Topics in Cryptology -- CT-RSA 2006

1. Front Matter

   PDF

2. Attacks on AES

   1. Cache Attacks and Countermeasures: The Case of AES

      • Dag Arne Osvik, Adi Shamir, Eran Tromer

      Pages 1-20

   2. Related-Key Impossible Differential Attacks on 8-Round AES-192

      • Eli Biham, Orr Dunkelman, Nathan Keller

      Pages 21-33

3. Identification

   1. Session Corruption Attack and Improvements on Encryption Based MT-Authenticators

      • Xiaojian Tian, Duncan S. Wong

      Pages 34-51

   2. Fair Identification

      • Omkant Pandey, Julien Cathalo, Jean-Jacques Quisquater

      Pages 52-63

4. Algebra

   1. Efficient Doubling on Genus 3 Curves over Binary Fields

      • Xinxin Fan, Thomas Wollinger, Yumin Wang

      Pages 64-81

   2. Another Look at Small RSA Exponents

      • M. Jason Hinek

      Pages 82-98

5. Integrity

   1. Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing

      • Michael Szydlo, Yiqun Lisa Yin

      Pages 99-114

   2. RFID-Tags for Anti-counterfeiting

      • Pim Tuyls, Lejla Batina

      Pages 115-131

6. Public Key Encryption

   1. A “Medium-Field” Multivariate Public-Key Encryption Scheme

      • Lih-Chung Wang, Bo-Yin Yang, Yuh-Hua Hu, Feipei Lai

      Pages 132-149

   2. A New Security Proof for Damgård’s ElGamal

      • Kristian Gjøsteen

      Pages 150-158

7. Signatures

   1. Stand-Alone and Setup-Free Verifiably Committed Signatures

      • Huafei Zhu, Feng Bao

      Pages 159-173

   2. Toward the Fair Anonymous Signatures: Deniable Ring Signatures

      • Yuichi Komano, Kazuo Ohta, Atsushi Shimbo, Shinichi Kawamura

      Pages 174-191

8. Side-Channel Attacks

   1. Practical Second-Order DPA Attacks for Masked Smart Card Implementations of Block Ciphers

      • Elisabeth Oswald, Stefan Mangard, Christoph Herbst, Stefan Tillich

      Pages 192-207

   2. Higher Order Masking of the AES

      • Kai Schramm, Christof Paar

      Pages 208-225

9. CCA Encryption

   1. Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles

      • Dan Boneh, Xavier Boyen, Shai Halevi

      Pages 226-243

   2. How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack

      • Yitao Duan, John Canny

      Pages 244-261

10. Message Authentication

    1. On the (Im)possibility of Blind Message Authentication Codes

       • Michel Abdalla, Chanathip Namprempre, Gregory Neven

       Pages 262-279

    2. An Optimal Non-interactive Message Authentication Protocol

       • Sylvain Pasini, Serge Vaudenay

       Pages 280-294

11. Block Ciphers

    1. A New Criterion for Nonlinearity of Block Ciphers

       • Orr Dunkelman, Nathan Keller

       Pages 295-312

The RSA R Conference, with over 15,000attendees, as well as over 225 sponsors and exhibitors, is the largest computer security event of the year. The Cr- tographers’ Track is one of the many parallel tracks. These proceedings contain the papers presented during the sixth edition. The tradition indeed started in 2001, and is by now well established: the Cryptographers’ Track at the RSA Conference is among the major events in cryptography. There were 72 submitted contributions, of which 22 were selected for p- sentation. They cover all aspects of cryptography (symmetric and asymmetric cryptography, constructions and attacks, new trends). In addition, the program includes two invited talks, by Xiaoyun Wang on “Cryptanalysis of Hash fu- tions and Potential Dangers,” and Philip MacKenzie on “Passwords Will Not Die: How Cryptography Can Help Deal with Them. ” All the submissions were reviewed by at least three members of the Program Committee. Iamverygratefultothe24membersfortheirhardandconscientious work.

• AES
• CCA encryption
• DES
• Message Authentication Code
• Oracle
• RSA
• authentication
• block ciphers
• communication
• cryptanalysis
• cryptographic protocols
• cryptology
• data security
• information security
• security
• algorithm analysis and problem complexity

• Ecole Normale Supérieure – LIENS/CNRS/INRIA, France

  David Pointcheval

Policies and ethics