Topics in Cryptology -- CT-RSA 2004

1. Front Matter

   PDF

2. Symmetric Encryption

   1. Online Encryption Schemes: New Security Notions and Constructions

      • Alexandra Boldyreva, Nut Taesombut

      Pages 1-14

   2. Related-Key Attacks on Triple-DES and DESX Variants

      • Raphael C. -W. Phan

      Pages 15-24

   3. Design of AES Based on Dual Cipher and Composite Field

      • Shee-Yau Wu, Shih-Chuan Lu, Chi Sung Laih

      Pages 25-38

   4. Periodic Properties of Counter Assisted Stream Ciphers

      • Ove Scavenius, Martin Boesgaard, Thomas Pedersen, Jesper Christiansen, Vincent Rijmen

      Pages 39-53

   5. A Fast Correlation Attack via Unequal Error Correcting LDPC Codes

      • Maneli Noorkami, Faramarz Fekri

      Pages 54-66

3. Aymmetric Encryption

   1. k-Resilient Identity-Based Encryption in the Standard Model

      • Swee-Huay Heng, Kaoru Kurosawa

      Pages 67-80

   2. A Generic Construction for Intrusion-Resilient Public-Key Encryption

      • Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung

      Pages 81-98

4. Digital Signatures

   1. A Certificate-Based Signature Scheme

      • Bo Gyeong Kang, Je Hong Park, Sang Geun Hahn

      Pages 99-111

   2. Identity Based Undeniable Signatures

      • Benoît Libert, Jean-Jacques Quisquater

      Pages 112-125

   3. Compressing Rabin Signatures

      • Daniel Bleichenbacher

      Pages 126-128

5. Protocols

   1. A Key Recovery System as Secure as Factoring

      • Adam Young, Moti Yung

      Pages 129-142

   2. Server Assisted Signatures Revisited

      • Kemal Bicakci, Nazife Baykal

      Pages 143-156

   3. Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95

      • Jean-Sébastien Coron, David Naccache

      Pages 157-162

   4. Universal Re-encryption for Mixnets

      • Philippe Golle, Markus Jakobsson, Ari Juels, Paul Syverson

      Pages 163-178

   5. Bit String Commitment Reductions with a Non-zero Rate

      • Anderson C. A. Nascimento, Joern Mueller-Quade, Hideki Imai

      Pages 179-193

   6. Improving Robustness of PGP Keyrings by Conflict Detection

      • Qinglin Jiang, Douglas S. Reeves, Peng Ning

      Pages 194-207

6. Side-Channel Attacks

   1. Issues of Security with the Oswald-Aigner Exponentiation Algorithm

      • Colin D. Walter

      Pages 208-221

   2. Hardware Countermeasures against DPA – A Statistical Analysis of Their Effectiveness

      • Stefan Mangard

      Pages 222-235

   3. Self-Randomized Exponentiation Algorithms

      • Benoît Chevallier-Mames

      Pages 236-249

The Cryptographers’ Track (CT-RSA) is a research conference within the RSA conference, the largest, regularly staged computer security event. CT-RSA 2004 was the fourth year of the Cryptographers’ Track, and it is now an established venue for presenting practical research results related to cryptography and data security. The conference received 77 submissions, and the program committee sel- ted 28 of these for presentation. The program committee worked very hard to evaluate the papers with respect to quality, originality, and relevance to cryp- graphy. Each paper was reviewed by at least three program committee members. Extended abstracts of the revised versions of these papers are in these proc- dings. The program also included two invited lectures by Dan Boneh and Silvio Micali. I am extremely grateful to the program committee members for their en- mous investment of time and e?ort in the di?cult and delicate process of review and selection. Many of them attended the program committee meeting during the Crypto 2003 conference at the University of California, Santa Barbara.

• Cisco
• DES
• Hardware
• RSA
• cryptography
• cryptology
• algorithm analysis and problem complexity

• NTT, Tokyo, Japan

  Tatsuaki Okamoto

Policies and ethics