Advances in Cryptology – EUROCRYPT 2010

1. Front Matter

   PDF

2. Cryptosystems I

   1. On Ideal Lattices and Learning with Errors over Rings

      • Vadim Lyubashevsky, Chris Peikert, Oded Regev

      Pages 1-23

   2. Fully Homomorphic Encryption over the Integers

      • Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan

      Pages 24-43

   3. Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups

      • David Mandell Freeman

      Pages 44-61

   4. Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

      • Allison Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters

      Pages 62-91

3. Obfuscation and Side Channel Security

   1. Secure Obfuscation for Encrypted Signatures

      • Satoshi Hada

      Pages 92-112

   2. Public-Key Encryption in the Bounded-Retrieval Model

      • Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs

      Pages 113-134

   3. Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

      • Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan

      Pages 135-156

4. 2-Party Protocols

   1. Partial Fairness in Secure Two-Party Computation

      • S. Dov Gordon, Jonathan Katz

      Pages 157-176

   2. Secure Message Transmission with Small Public Discussion

      • Juan Garay, Clint Givens, Rafail Ostrovsky

      Pages 177-196

   3. On the Impossibility of Three-Move Blind Signature Schemes

      • Marc Fischlin, Dominique Schröder

      Pages 197-215

   4. Efficient Device-Independent Quantum Key Distribution

      • Esther Hänggi, Renato Renner, Stefan Wolf

      Pages 216-234

5. Cryptanalysis

   1. New Generic Algorithms for Hard Knapsacks

      • Nick Howgrave-Graham, Antoine Joux

      Pages 235-256

   2. Lattice Enumeration Using Extreme Pruning

      • Nicolas Gama, Phong Q. Nguyen, Oded Regev

      Pages 257-278

   3. Algebraic Cryptanalysis of McEliece Variants with Compact Keys

      • Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich

      Pages 279-298

   4. Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds

      • Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir

      Pages 299-319

6. IACR Distinguished Lecture

   1. Cryptography between Wonderland and Underland

      • Moti Yung

      Pages 320-321

7. Automated Tools and Formal Methods

   1. Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others

      • Alex Biryukov, Ivica Nikolić

      Pages 322-344

   2. Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR

      • Kenneth G. Paterson, Gaven J. Watson

      Pages 345-361

   3. Computational Soundness, Co-induction, and Encryption Cycles

      • Daniele Micciancio

      Pages 362-380

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.

• AES
• Broadcast
• algebra
• algorithms
• complexity
• cryptoanalysis
• cryptography
• cryptology
• cryptosystems
• database
• digital signature
• encryption
• hash function
• information security
• security
• algorithm analysis and problem complexity

• Orange Labs/MAPS/STT, Issy les Moulineaux Cedex 9, France

  Henri Gilbert

Policies and ethics