CRYPTO 2002

SANTA BARBARA, CALIFORNIA, USA

Moti Yung (Ed.): Advances in Cryptology - CRYPTO '02: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002, Proceedings. Lecture Notes in Computer Science, Vol. 2442 Springer, 2002 ISSN: 0302-9743

Read the paper abstracts. More »

Block Ciphers

• Sean Murphy and Matthew J.B. Robshaw: Essential Algebraic Structure within the AES. 1-16
• Antoine Joux, Gwenaëlle Martinet, Frédéric Valette: Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC. 17-30
• Moses Liskov, Ronald L. Rivest, David Wagner: Tweakable Block Ciphers. 31-46

Multi-user Oriented Cryptosystems

• Dani Halevy and Adi Shamir: The LSD Broadcast Encryption Scheme. 47-60
• Jan Camenisch and Anna Lysyanskaya: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. 61-76

Foundations and Methodology

• Nicholas J. Hopper, John Langford, Luis von Ahn: Provably Secure Steganography: (Extended Abstract). 77-92
• Jacques Stern, David Pointcheval, John Malone-Lee, et al.: Flaws in Applying Proof Methodologies to Signature Schemes. 93-110
• Jesper Buus Nielsen: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. 111-126

Security of Practical Protocols

• Jakob Jonsson and Burton S. Kaliski Jr.: On the Security of RSA Encryption in TLS. 127-142
• Ran Canetti and Hugo Krawczyk: Security Analysis of IKE's Signature-Based Key-Exchange Protocol. 143-161
• Mihir Bellare and Adriana Palacio: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. 162-177

Secure Multiparty Computation

• Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, et al.: On 2-Round Secure Multiparty Computation. 178-193
• Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, et al.: Private Computation - k-Connected versus 1-Connected Networks. 194-209

Public-Key Encryption

• Phong Q. Nguyen and David Pointcheval: Analysis and Improvements of NTRU Encryption Paddings. 210-225
• Jean-Sébastien Coron, Marc Joye, David Naccache, et al.: Universal Padding Schemes for RSA. 226-241
• Alexander May: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. 242-256

Information Theory and Secret Sharing

• Chi-Jen Lu: Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors. 257-271
• Ronald Cramer and Serge Fehr: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. 272-287

Cipher Design and Analysis

• David Wagner: A Generalized Birthday Problem: (Extended Abstract). 288-303
• Ilya Mironov: (Not So) Random Shuffles of RC4. 304-319
• John Black, Phillip Rogaway, Thomas Shrimpton: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. 320-335

Elliptic Curves and Abelian Varieties

• Karl Rubin and Alice Silverberg: Supersingular Abelian Varieties in Cryptology. 336-353
• Paulo S.L.M. Barreto, Hae Y. Kim, Ben Lynn, et al.: Efficient Algorithms for Pairing-Based Cryptosystems. 354-368
• Frederik Vercauteren: Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2. 369-384

Password-Based Authentication

• Philip MacKenzie, Thomas Shrimpton, Markus Jakobsson: Threshold Password-Authenticated Key Exchange: (Extended Abstract). 385-400

Distributed Cryptosystems

• Jesper Buus Nielsen: A Threshold Pseudorandom Function Construction and Its Applications. 401-416
• Joy Algesheimer, Jan Camenisch, Victor Shoup: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. 417-432

Pseudorandomness and Applications

• Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski: Hidden Number Problem with the Trace and Bit Security of XTR and LUC. 433-448
• Ivan Damgård and Jesper Buus Nielsen: Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. 449-464

Variations on Signatures and Authentication

• Emmanuel Bresson, Jacques Stern, Michael Szydlo: Threshold Ring Signatures and Applications to Ad-hoc Groups. 465-480
• Moni Naor: Deniable Ring Authentication. 481-498
• Gene Itkis and Leonid Reyzin: SiBIR: Signer-Base Intrusion-Resilient Signatures. 499-514

Stream Ciphers and Boolean Functions

• Don Coppersmith, Shai Halevi, Charanjit Jutla: Cryptanalysis of Stream Ciphers with Linear Masking. 515-532
• Palash Sarkar: The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers. 533-548
• Claude Carlet: A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction. 549-564

Commitment Schemes

• Serge Fehr and Ueli Maurer: Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. 565-580
• Ivan Damgård and Jesper Buus Nielsen: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. 581-596

Signature Schemes

• Anna Lysyanskaya: Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. 597-612
• Jean-Sébastien Coron: Security Proof for Partial-Domain Hash Signature Schemes. 613-626