Publications of Eurocrypt 2015

Page	Title
3-12	Cryptanalysis of the Multilinear Map over the Integers
3-34	Universal Signature Aggregators
15-44	Robust Authenticated-Encryption AEZ and the Problem That It Solves
35-65	Fully Structure-Preserving Signatures and Shrinking Commitments
45-74	On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
69-100	Disjunctions for Hash Proof Systems: New Constructions and Applications
77-100	A Provable-Security Analysis of Intel's Secure Key RNG
101-126	A Formal Treatment of Backdoored Pseudorandom Generators
101-128	Quasi-Adaptive NIZK for Linear Subspaces Revisited
129-155	Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
131-158	Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free Hardware
156-170	The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
159-188	Noisy Leakage Revisited
173-202	Better Algorithms for LWE and LWR
191-219	Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
203-228	On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
220-250	Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates
231-253	Cryptanalytic Time-Memory-Data Tradeoffs for FX-Constructions with Applications to PRINCE and PRIDE
253-280	One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
254-283	A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
281-310	The Bitcoin Backbone Protocol: Analysis and Applications
287-314	Structural Evaluation by Generalized Integral Property
313-336	Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
315-342	Cryptanalysis of SP Networks with Partial Non-Linear Layers
337-367	Function Secret Sharing
345-367	The Sum Can Be Weaker Than Each Part
368-397	SPHINCS: Practical Stateless Hash-Based Signatures
371-403	Cluster Computing in Zero Knowledge
401-429	Making Masking Security Proofs Concrete - Or How to Evaluate the Security of Any Leaking Device
404-436	Hosting Services on an Untrusted Cloud
430-454	Ciphers for MPC and FHE
439-467	How to Obfuscate Programs Directly
457-485	Verified Proofs of Higher-Order Masking
468-498	End-to-End Verifiable Elections in the Standard Model
486-510	Inner Product Masking Revisited
501-531	Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
513-536	Fully Homomophic Encryption over the Integers Revisited
532-560	Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
537-555	(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
559-583	KDM-CCA Security from RKA Secure Authenticated Encryption
563-594	Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
584-613	On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
595-624	Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
617-640	FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
627-656	Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
641-670	Bootstrapping for HElib
657-686	Cryptographic Reverse Firewalls
673-701	More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
689-718	Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols
702-729	How to Efficiently Evaluate RAM Programs with Malicious Security
719-751	Authenticated Key Exchange from Ideal Lattices
733-761	Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
755-784	Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
762-786	Twisted Polynomials and Forgery Attacks on GCM
785-814	Privacy Amplification in the Isolated Qubits Model
789-815	Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
817-836	Generic Hardness of the Multiple Discrete Logarithm Problem