Topics in Cryptology - CT-RSA 2002

1. Front Matter

   Pages I-X

   PDF

2. Public Key Cryptography

   1. On Hash Function Firewalls in Signature Schemes

      • Burton S. Kaliski Jr.

      Pages 1-16

   2. Observability Analysis - Detecting When Improved Cryptosystems Fail -

      • Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung

      Pages 17-29

3. Efficient Hardware Implementations

   1. Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli

      • Colin D. Walter

      Pages 30-39

   2. Montgomery in Practice: How to Do It More Efficiently in Hardware

      • Lejla Batina, Geeke Muurling

      Pages 40-52

   3. MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis

      • Colin D. Walter

      Pages 53-66

   4. An ASIC Implementation of the AES SBoxes

      • Johannes Wolkerstorfer, Elisabeth Oswald, Mario Lamberger

      Pages 67-78

4. Public Key Cryptography: Theory

   1. On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function

      • Marc Fischlin

      Pages 79-95

   2. The Representation Problem Based on Factoring

      • Marc Fischlin, Roger Fischlin

      Pages 96-113

5. Symmetric Ciphers

   1. Ciphers with Arbitrary Finite Domains

      • John Black, Phillip Rogaway

      Pages 114-130

   2. Known Plaintext Correlation Attack against RC5

      • Atsuko Miyaji, Masao Nonaka, Yoshinori Takii

      Pages 131-148

6. E-Commerce and Applications

   1. Micropayments Revisited

      • Silvio Micali, Ronald L. Rivest

      Pages 149-163

   2. Proprietary Certificates

      • Markus Jakobsson, Ari Juels, Phong Q. Nguyen

      Pages 164-181

   3. Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption

      • Giuseppe Ateniese, Cristina Nita-Rotaru

      Pages 182-199

7. Digital Signatures

   1. RSA-Based Undeniable Signatures for General Moduli

      • Steven D. Galbraith, Wenbo Mao, Kenneth G. Paterson

      Pages 200-217

   2. Co-operatively Formed Group Signatures

      • Greg Maitland, Colin Boyd

      Pages 218-235

   3. Transitive Signature Schemes

      • Silvio Micali, Ronald L. Rivest

      Pages 236-243

   4. Homomorphic Signature Schemes

      • Robert Johnson, David Molnar, Dawn Song, David Wagner

      Pages 244-262

8. Public Key Encryption

   1. GEM: A Generic Chosen-Ciphertext Secure Encryption Method

      • Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen

      Pages 263-276

   2. Securing “Encryption + Proof of Knowledge” in the Random Oracle Model

      • Masayuki Abe

      Pages 277-289

This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers’ Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag’s Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers’ Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest (“Micropayments Revisited” – joint work with Silvio Micali) and by Victor Shoup (“The Bumpy Road from Cryptographic Theory to Practice”). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews.Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings.Inalimitednumberofcases,these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers’ Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara.

• Access Control
• Authentication
• Computational Number Theory
• Cryptanalysis
• Cryptographic Protocols
• Cryptography
• Data Security
• Hardware
• Information Security
• Public Key Cryptosystems
• RSA
• Secure Communication
• cryptology
• algorithm analysis and problem complexity

• Department of Electrical Engineering, Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium

  Bart Preneel

Policies and ethics