Advances in Cryptology - CRYPTO 2002

1. Front Matter

   Pages I-XIV

   PDF

2. Block Ciphers

   1. Essential Algebraic Structure within the AES

      • Sean Murphy, Matthew J.B. Robshaw

      Pages 1-16

   2. Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC

      • Antoine Joux, Gwenaëlle Martinet, Frédéric Valette

      Pages 17-30

   3. Tweakable Block Ciphers

      • Moses Liskov, Ronald L. Rivest, David Wagner

      Pages 31-46

3. Multi-user Oriented Cryptosystems

   1. The LSD Broadcast Encryption Scheme

      • Dani Halevy, Adi Shamir

      Pages 47-60

   2. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

      • Jan Camenisch, Anna Lysyanskaya

      Pages 61-76

4. Foundations and Methodology

   1. Provably Secure Steganography

      • Nicholas J. Hopper, John Langford, Luis von Ahn

      Pages 77-92

   2. Flaws in Applying Proof Methodologies to Signature Schemes

      • Jacques Stern, David Pointcheval, John Malone-Lee, Nigel P. Smart

      Pages 93-110

   3. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

      • Jesper Buus Nielsen

      Pages 111-126

5. Security of Practical Protocols

   1. On the Security of RSA Encryption in TLS

      • Jakob Jonsson, Burton S. Kaliski Jr.

      Pages 127-142

   2. Security Analysis of IKE’s Signature-Based Key-Exchange Protocol

      • Ran Canetti, Hugo Krawczyk

      Pages 143-161

   3. GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks

      • Mihir Bellare, Adriana Palacio

      Pages 162-177

6. Secure Multiparty Computation

   1. On 2-Round Secure Multiparty Computation

      • Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin

      Pages 178-193

   2. Private Computation — k-Connected versus 1-Connected Networks

      • Markus Bläser, Andreas Jakoby, Maciej Liśkiewicz, Bodo Siebert

      Pages 194-209

7. Public-Key Encryption

   1. Analysis and Improvements of NTRU Encryption Paddings

      • Phong Q. Nguyen, David Pointcheval

      Pages 210-225

   2. Universal Padding Schemes for RSA

      • Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier

      Pages 226-241

   3. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent

      • Alexander May

      Pages 242-256

8. Information Theory and Secret Sharing

   1. Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors

      • Chi-Jen Lu

      Pages 257-271

   2. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

      • Ronald Cramer, Serge Fehr

      Pages 272-287

9. Cipher Design and Analysis

   1. A Generalized Birthday Problem

      • David Wagner

      Pages 288-304

Crypto 2002, the 22nd Annual Crypto Conference, was sponsored by IACR, the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. It is published as Vol. 2442 of the Lecture Notes in Computer Science (LNCS) of Springer Verlag. Note that 2002, 22 and 2442 are all palindromes... (Don’t nod!) Theconferencereceived175submissions,ofwhich40wereaccepted;twos- missionsweremergedintoasinglepaper,yieldingthetotalof39papersaccepted for presentation in the technical program of the conference. In this proceedings volume you will ?nd the revised versions of the 39 papers that were presented at the conference. The submissions represent the current state of work in the cryptographic community worldwide, covering all areas of cryptologic research. In fact, many high-quality works (that surely will be published elsewhere) could not be accepted. This is due to the competitive nature of the conference and the challenging task of selecting a program. I wish to thank the authors of all submitted papers. Indeed, it is the authors of all papers who have made this conference possible, regardless of whether or not their papers were accepted. The conference program was also immensely bene?ted by two plenary talks.

• Boolean function
• Cryptography
• algorithmic number theory
• authentication
• cryptoanalysis
• cryptographic protocolls
• data encryption
• digital signatures
• finite field computations
• information
• information theory
• multi-party computation
• public key cryptography
• security
• algorithm analysis and problem complexity

• Department of Computer Science, Columbia University, NewYork, USA

  Moti Yung