This book constitutes the refereed proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011, held in Tallinn, Estonia, in May 2011.
The 31 papers, presented together with 2 invited talks, were carefully reviewed and selected from 167 submissions. The papers are organized in topical sections on lattice-base cryptography, implementation and side channels, homomorphic cryptography, signature schemes, information-theoretic cryptography, symmetric key cryptography, attacks and algorithms, secure computation, composability, key dependent message security, and public key encryption.
Author(s): Ronald Cramer (auth.), Kenneth G. Paterson (eds.)
Series: Lecture Notes in Computer Science 6632
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2011
Language: English
Pages: 628
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 -
The Arithmetic Codex: Theory and Applications....Pages 1-1
Lattice Reduction Algorithms: Theory and Practice....Pages 2-6
Efficient Authentication from Hard Learning Problems....Pages 7-26
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices....Pages 27-47
Faster Explicit Formulas for Computing Pairings over Ordinary Curves....Pages 48-68
Pushing the Limits: A Very Compact and a Threshold Implementation of AES....Pages 69-88
Fully Leakage-Resilient Signatures....Pages 89-108
A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices....Pages 109-128
Implementing Gentry’s Fully-Homomorphic Encryption Scheme....Pages 129-148
Homomorphic Signatures for Polynomial Functions....Pages 149-168
Semi-homomorphic Encryption and Multiparty Computation....Pages 169-188
Tight Proofs for Signature Schemes without Random Oracles....Pages 189-206
Adaptive Pseudo-free Groups and Applications....Pages 207-223
Commuting Signatures and Verifiable Encryption....Pages 224-245
Secure Authentication from a Weak Key, without Leaking Information....Pages 246-265
Secret Keys from Channel Noise....Pages 266-283
Almost Optimum t -Cheater Identifiable Secret Sharing Schemes....Pages 284-302
On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN....Pages 303-322
Domain Extension for MACs Beyond the Birthday Barrier....Pages 323-342
Statistical Attack on RC4....Pages 343-363
Improved Generic Algorithms for Hard Knapsacks....Pages 364-385
Two-Output Secure Computation with Malicious Adversaries....Pages 386-405
Efficient Non-interactive Secure Computation....Pages 406-425
Towards a Game Theoretic View of Secure Computation....Pages 426-445
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption....Pages 446-466
Concurrent Composition in the Bounded Quantum Storage Model....Pages 467-486
Careful with Composition: Limitations of the Indifferentiability Framework....Pages 487-506
Efficient Circuit-Size Independent Public Key Encryption with KDM Security....Pages 507-526
Key-Dependent Message Security: Generic Amplification and Completeness....Pages 527-546
Unbounded HIBE and Attribute-Based Encryption....Pages 547-567
Decentralizing Attribute-Based Encryption....Pages 568-588
Threshold and Revocation Cryptosystems via Extractable Hash Proofs....Pages 589-609
Deniable Encryption with Negligible Detection Probability: An Interactive Construction....Pages 610-626
Back Matter....Pages -
