These are the proceedings of Eurocrypt 2010, the 29th in the series of Eu- pean conferences on the Theory and Application of Cryptographic Techniques. The conference was sponsored by the International Association for Cryptologic Research and held on the French Riviera, May 30–June 3, 2010. A total of 191 papers were received of which 188 were retained as valid submissions. These were each assigned to at least three Program Committee members and a total of 606 review reports were produced. The printed record of the reviews and extensive online discussions that followed would be almost as voluminous as these proceedings. In the end 35 submissions were accepted with twosubmissionpairsbeingmergedtogive33paperspresentedattheconference. The ?nal papers in these proceedings were not subject to a second review before publication and the authors are responsible for their contents. The ProgramCommittee, listed on the next page, deservesparticular thanks for all their hard work, their outstanding expertise, and their constant c- mitment to all aspects of the evaluation process. These thanks are of course extended to the very many external reviewers who took the time to help out during the evaluation process.It was also a greatpleasure to honor and welcome Moti Yung who gave the 2010 IACR Distinguished Lecture.
Author(s): Vadim Lyubashevsky, Chris Peikert, Oded Regev (auth.), Henri Gilbert (eds.)
Series: Lecture Notes in Computer Science 6110 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 694
City: Berlin ; Heidelberg New York, NY
Tags: Data Encryption; Systems and Data Security; Computer Communication Networks; Management of Computing and Information Systems; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science
Front Matter....Pages -
On Ideal Lattices and Learning with Errors over Rings....Pages 1-23
Fully Homomorphic Encryption over the Integers....Pages 24-43
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups....Pages 44-61
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption....Pages 62-91
Secure Obfuscation for Encrypted Signatures....Pages 92-112
Public-Key Encryption in the Bounded-Retrieval Model....Pages 113-134
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases....Pages 135-156
Partial Fairness in Secure Two-Party Computation....Pages 157-176
Secure Message Transmission with Small Public Discussion....Pages 177-196
On the Impossibility of Three-Move Blind Signature Schemes....Pages 197-215
Efficient Device-Independent Quantum Key Distribution....Pages 216-234
New Generic Algorithms for Hard Knapsacks....Pages 235-256
Lattice Enumeration Using Extreme Pruning....Pages 257-278
Algebraic Cryptanalysis of McEliece Variants with Compact Keys....Pages 279-298
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds....Pages 299-319
Cryptography between Wonderland and Underland....Pages 320-321
Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others....Pages 322-344
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR....Pages 345-361
Computational Soundness, Co-induction, and Encryption Cycles....Pages 362-380
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks....Pages 381-402
Cryptographic Agility and Its Relation to Circular Encryption....Pages 403-422
Bounded Key-Dependent Message Security....Pages 423-444
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography....Pages 445-465
Adaptively Secure Broadcast....Pages 466-485
Universally Composable Quantum Multi-party Computation....Pages 486-505
A Simple BGN-Type Cryptosystem from LWE....Pages 506-522
Bonsai Trees, or How to Delegate a Lattice Basis....Pages 523-552
Efficient Lattice (H)IBE in the Standard Model....Pages 553-572
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation....Pages 573-596
Stam’s Collision Resistance Conjecture....Pages 597-615
Universal One-Way Hash Functions via Inaccessible Entropy....Pages 616-637
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions....Pages 638-655
Constructing Verifiable Random Functions with Large Input Spaces....Pages 656-672
Adaptive Trapdoor Functions and Chosen-Ciphertext Security....Pages 673-692
Back Matter....Pages -
