This book constitutes the refereed proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2012, held in Cambgridge, UK, in April 2012.
The 41 papers, presented together with 2 invited talks, were carefully reviewed and selected from 195 submissions. The papers are organized in topical sections on index calculus, symmetric constructions, secure computation, protocols, lossy trapdoor functions, tools, symmetric cryptanalysis, fully homomorphic encryption, asymmetric cryptanalysis, efficient reductions, public-key schemes, security models, and lattices.
Author(s): Antoine Joux (auth.), David Pointcheval, Thomas Johansson (eds.)
Series: Lecture Notes in Computer Science 7237 Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012
Language: English
Pages: 758
City: Berlin ; New York
Tags: Data Encryption; Computer Communication Networks; Systems and Data Security; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Management of Computing and Information Systems
Front Matter....Pages -
A Tutorial on High Performance Computing Applied to Cryptanalysis....Pages 1-7
Another Look at Provable Security....Pages 8-8
Cover and Decomposition Index Calculus on Elliptic Curves Made Practical....Pages 9-26
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields....Pages 27-44
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations....Pages 45-62
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading....Pages 63-80
Fair Computation with Rational Players....Pages 81-98
Concurrently Secure Computation in Constant Rounds....Pages 99-116
Identity-Based Encryption Resilient to Continual Auxiliary Leakage....Pages 117-134
Quantum Proofs of Knowledge....Pages 135-152
On Round-Optimal Zero Knowledge in the Bare Public-Key Model....Pages 153-171
Robust Coin Flipping....Pages 172-194
Unconditionally-Secure Robust Secret Sharing with Compact Shares....Pages 195-208
All-But-Many Lossy Trapdoor Functions....Pages 209-227
Identity-Based (Lossy) Trapdoor Functions and Applications....Pages 228-245
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More....Pages 246-262
Efficient Zero-Knowledge Argument for Correctness of a Shuffle....Pages 263-280
Malleable Proof Systems and Applications....Pages 281-300
Group to Group Commitments Do Not Shrink....Pages 301-317
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting....Pages 318-335
Minimalism in Cryptography: The Even-Mansour Scheme Revisited....Pages 336-354
Message Authentication, Revisited....Pages 355-374
Property Preserving Symmetric Encryption....Pages 375-391
Narrow-Bicliques: Cryptanalysis of Full IDEA....Pages 392-410
Cryptanalyses on a Merkle-Damgård Based MAC — Almost Universal Forgery and Distinguishing- H Attacks....Pages 411-427
Statistical Tools Flavor Side-Channel Collision Attacks....Pages 428-445
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers....Pages 446-464
Fully Homomorphic Encryption with Polylog Overhead....Pages 465-482
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE....Pages 483-501
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers....Pages 502-519
Decoding Random Binary Linear Codes in 2 n/20 : How 1 + 1 = 0 Improves Information Set Decoding....Pages 520-536
Optimal Security Proofs for Full Domain Hash, Revisited....Pages 537-553
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model....Pages 554-571
Tightly-Secure Signatures from Lossy Identification Schemes....Pages 572-590
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption....Pages 591-608
Scalable Group Signatures with Revocation....Pages 609-627
Incremental Deterministic Public-Key Encryption....Pages 628-644
Standard Security Does Not Imply Security against Selective-Opening....Pages 645-662
Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security....Pages 663-681
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation....Pages 682-699
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller....Pages 700-718
Pseudorandom Functions and Lattices....Pages 719-737
Lattice Signatures without Trapdoors....Pages 738-755
Back Matter....Pages -
