The two-volume proceedings LNCS 9665 + 9666 constitutes the thoroughly refereed proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016, held in Vienna, Austria, in May 2016. The 62 full papers included in these volumes were carefully reviewed and selected from 274 submissions. The papers are organized in topical sections named: (pseudo)randomness; LPN/LWE; cryptanalysis; masking; fully homomorphic encryption; number theory; hash functions; multilinear maps; message authentification codes; attacks on SSL/TLS; real-world protocols; robust designs; lattice reduction; latticed-based schemes; zero-knowledge; pseudorandom functions; multi-party computation; separations; protocols; round complexity; commitments; lattices; leakage; in differentiability; obfuscation; and automated analysis, functional encryption, and non-malleable codes.
Author(s): Marc Fischlin, Jean-Sébastien Coron (eds.)
Series: Lecture Notes in Computer Science 9666
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2016
Language: English
Pages: XX, 911
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Systems and Data Security; Management of Computing and Information Systems; Discrete Mathematics in Computer Science
Front Matter....Pages I-XX
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors....Pages 1-31
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters....Pages 32-62
Online/Offline OR Composition of Sigma Protocols....Pages 63-92
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance....Pages 93-123
Constrained Pseudorandom Functions for Unconstrained Inputs....Pages 124-153
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN....Pages 154-183
Secure Computation from Elastic Noisy Channels....Pages 184-212
All Complete Functionalities are Reversible....Pages 213-242
On the Power of Hierarchical Identity-Based Encryption....Pages 243-272
On the Impossibility of Tight Cryptographic Reductions....Pages 273-304
On the Size of Pairing-Based Non-interactive Arguments....Pages 305-326
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting....Pages 327-357
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model....Pages 358-387
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key....Pages 388-419
Unconditionally Secure Computation with Reduced Interaction....Pages 420-447
The Exact Round Complexity of Secure Computation....Pages 448-476
On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments....Pages 477-496
Computationally Binding Quantum Commitments....Pages 497-527
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems....Pages 528-558
Recovering Short Generators of Principal Ideals in Cyclotomic Rings....Pages 559-585
Randomness Complexity of Private Circuits for Multiplication....Pages 586-615
10-Round Feistel is Indifferentiable from an Ideal Cipher....Pages 616-648
Indifferentiability of Confusion-Diffusion Networks....Pages 649-678
Fair and Robust Multi-party Computation Using a Global Transaction Ledger....Pages 679-704
Two Round Multiparty Computation via Multi-key FHE....Pages 705-734
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits....Pages 735-763
New Negative Results on Differing-Inputs Obfuscation....Pages 764-791
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model....Pages 792-821
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions....Pages 822-851
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits....Pages 852-880
Back Matter....Pages 881-908
....Pages 909-911
