Advances in Cryptology – EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 – June 3, 2010. Proceedings

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 -