CRYPTO '97 Preliminary Program

(Updated July 30, 1997 - Subject to Change)

Sponsored by
The International Association for Cryptologic Research

All sessions are in Campbell Hall, except as noted. All breakfasts and lunches are in De La Guerra Dining Commons. Entry to the dining hall for breakfast is 7:00-8:00; lunch 12:30-1:30.

Sunday, August 17, 1997

2:00-8:00 Registration, Anacapa Lounge

5:30-6:30 Pre-Registration Reception, Anacapa Front Patio

6:30-10:00 Reception, Anacapa Lawn

Monday, August 18, 1997

7:00-8:00 Breakfast, De La Guerra Commons

8:00- Registration, outside Campbell Hall

8:30-8:40 Welcome

Session 1: Complexity Theory
Chair: Burt Kaliski (RSA Laboratories, USA)

8:40-9:10 The Complexity of Computing Hard Core Predicates
Mikael Goldmann (Royal Institute of Technology, Sweden) and Mats Näslund (Royal Institute of Technology, Sweden)

9:10-9:40 Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
Eiichiro Fujisaki (NTT Laboratories, Japan) and Tatsuaki Okamoto (NTT Laboratories, Japan)

9:40-10:10 Keeping the SZK-Verifier Honest Unconditionally
Giovanni Di Crescenzo (University of California at San Diego, USA), Tatsuaki Okamoto (NTT Laboratories, Japan), and Moti Yung (CertCo, USA)

10:10-10:30 Break

Session 2: Invited Lecture
Chair: Hugo Krawczyk (IBM T.J. Watson Research Center, USA, and Technion, Israel)

10:30-11:30 On the Foundations of Modern Cryptography
Oded Goldreich (Computer Science Department, Weizmann Institute, Israel)

Session 3: Cryptographic Primitives
Chair: Alfredo de Santis (Università di Salerno, Italy)

11:30-12:00 Plug and Play Encryption
Donald Beaver (Transarc, USA)

12:00-12:30 Deniable Encryption
Ran Canetti (IBM T.J. Watson Research Center, USA), Cynthia Dwork (IBM Almaden Research Center, USA), Moni Naor (Weizmann Institute of Science, Israel), and Rafail Ostrovsky (Bellcore, USA)

12:30-2:00 Lunch, De La Guerra Commons

Session 4: Lattice-Based Cryptography
Chair: Michael J. Wiener (Entrust Technologies, Canada)

2:20-2:50 Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
Oded Goldreich (Computer Science Department, Weizmann Institute, Israel), Shafi Goldwasser (MIT Laboratory for Computer Science, USA), and Shai Halevi (MIT Laboratory for Computer Science, USA)

2:50-3:20 Public-Key Cryptosystems from Lattice Reduction Problems
Oded Goldreich (Computer Science Department, Weizmann Institute, Israel), Shafi Goldwasser (MIT Laboratory for Computer Science, USA), and Shai Halevi (MIT Laboratory for Computer Science, USA)

3:20-3:40 Break

Session 5: Digital Signatures
Chair: Susan Langford (Atalla Corporation, USA)

3:40-4:10 RSA-Based Undeniable Signatures
Rosario Gennaro (IBM T.J. Watson Research Center, USA), Hugo Krawczyk (IBM T.J. Watson Research Center, USA, and Technion, Israel), and Tal Rabin (IBM T.J. Watson Research Center, USA)

4:10-4:40 Security of Blind Digital Signatures
Ari Juels (RSA Laboratories, USA), Michael Luby (Digital Equipment Corporation, USA), and Rafail Ostrovsky (Bellcore, USA)

4:40-5:10 Digital Signcryption or How to Achieve Cost (Signature & Encryption) << Cost (Signature) + Cost (Encryption)
Yuliang Zheng (Monash University, Australia)

5:10-5:40 How to Sign Digital Streams
Rosario Gennaro (IBM T.J. Watson Research Center, USA) and Pankaj Rohatgi (IBM T.J. Watson Research Center, USA)

7:00-10:00 Reception, De La Guerra Lawn

Tuesday, August 19, 1997


7:00-8:00 Breakfast, De La Guerra Commons

Session 6: Cryptanalysis of Public-Key Cryptosystems (I)
Chair: Ivan Damgård (Aarhus University, Denmark)

8:30-9:00 Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
Phong Nguyen (Ecole Normale Supérieure, France) and Jacques Stern (Ecole Normale Supérieure, France)

9:00-9:30 Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack
Thomas A. Berson (Anagram Laboratories, USA)

9:30-10:00 A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy
Jean-François Misarsky (France Telecom, France)

10:00-10:30 Break

Session 7: Cryptanalysis of Public-Key Cryptosystems (II)
Chair: Johannes Buchmann (Techniche Hochschule Darmstadt, Germany)

10:30-11:00 On the Security of the KMOV Public Key Cryptosystem
Daniel Bleichenbacher (Bell Laboratories, USA)

11:00-11:30 A Key Recovery Attack on Discrete Log-Based Schemes Using a Prime Order Subgroup
Chae Hoon Lim (Future Systems Inc., Korea) and Pil Joong Lee (Pohang Univ. of Science & Technology, Korea)

11:30-12:00 The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems
Adam Young (Columbia University, USA) and Moti Yung (CertCo, USA)

12:00-12:30 "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DSS Case
Mihir Bellare (University of California at San Diego, USA), Shafi Goldwasser (MIT Laboratory for Computer Science, USA), and Daniele Micciancio(MIT Laboratory for Computer Science, USA)

12:30-2:00 Lunch, De La Guerra Commons

Free Afternoon

Rump Session
Chair: Stuart Haber (Surety Technologies, USA)

7:00-11:00 Informal presentations to be announced
Corwin Pavilion in the University Center

Wednesday, August 20, 1997


7:00-8:00 Breakfast, De La Guerra Commons

Session 8: Information Theory
Chair: Gilles Brassard (Université de Montréal, Canada)

8:20-8:50 Unconditional Security Against Memory-Bounded Adversaries
Christian Cachin (ETH Zürich, Switzerland) and Ueli Maurer (ETH Zürich, Switzerland)

8:50-9:20 Privacy Amplification Secure Against Active Adversaries
Ueli Maurer (ETH Zürich, Switzerland) and Stefan Wolf (ETH Zürich, Switzerland)

9:20-9:50 Visual Authentication and Identification
Moni Naor (Weizmann Institute of Science, Israel) and Benny Pinkas (Weizmann Institute of Science, Israel)

9:50-10:10 Break

Session 9: Invited Lecture
Chair: Neal Koblitz (University of Washington, USA)

10:10-11:10 Quantum Information Processing: The Good, the Bad, and the Ugly
Gilles Brassard (Université de Montréal, Canada)

Session 10: Elliptic Curve Implementation
Chair: Antoon Bosselaers (Katholieke Universiteit Leuven, Belgium)

11:10-11:40 Efficient Algorithms for Elliptic Curve Cryptosystems
Jorge Guajardo (WPI, USA) and Christof Paar (WPI, USA)

11:40-12:10 An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
Jerome A. Solinas (National Security Agency, USA)

12:10-1:30 Lunch, De La Guerra Commons

Session 11: Number-Theoretic Systems
Chair: Tatsuaki Okamoto (NTT Laboratories, Japan)

1:30-2:00 Fast RSA-Type Cryptosystems Using n-adic Expansion
Tsuyoshi Takagi (NTT Software Laboratories, Japan)

2:00-2:30 A One Way Function Based on Ideal Arithmetic in Number Fields
Johannes Buchmann (Technische Hochschule Darmstadt, Germany) and Sachar Paulus (Technische Hochschule Darmstadt, Germany)

2:30-2:50 Break

Session 12: Distributed Cryptography
Chair: Rebecca Wright (AT&T Labs, USA)

2:50-3:20 Efficient Anonymous Multicast and Reception
Shlomi Dolev (Ben-Gurion University, Israel) and Rafail Ostrovsky (Bellcore, USA)

3:20-3:50 Efficient Group Signature Schemes for Large Groups
Jan Camenisch (ETH Zürich, Switzerland) and Markus Stadler (Ubilab/UBS, Switzerland)

3:50-4:20 Efficient Generation of Shared RSA Keys
Dan Boneh (Bellcore, USA) and Matthew Franklin (AT&T Labs, USA)

4:20-4:50 Proactive RSA
Yair Frankel (CertCo, USA and Sandia National Laboratories, USA), Peter Gemmell (Sandia National Laboratories, USA), Philip D. MacKenzie (Boise State University, Idaho), and Moti Yung (CertCo, USA)

4:50-5:35 IACR Business Meeting

6:00-9:00 Beach Barbecue, Goleta Beach

8:00-10:30 Crypto Café, Anacapa Lounge

Thursday, August 21, 1997


7:00-8:00 Breakfast, De La Guerra Commons

Session 13: Hash Functions
Chair: Yuliang Zheng (Monash University, Australia)

8:30-9:00 Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information
Ran Canetti (IBM T.J. Watson Research Center, USA)

9:00-9:30 Collision-Resistant Hashing: Towards Making UOWHFs Practical
Mihir Bellare (University of California at San Diego, USA) and Phillip Rogaway (University of California at Davis, USA)

9:30-10:00 Fast and Secure Hashing Based on Codes
Lars Knudsen (Katholieke Universiteit Leuven, Belgium) and Bart Preneel (Katholieke Universiteit Leuven, Belgium)

10:00-10:30 Break

Session 14: Cryptanalysis of Secret-Key Cryptosystems
Chair: Douglas Stinson (University of Nebraska, USA)

10:30-11:00 Edit Distance Correlation Attack on the Alternating Step Generator
Jovan Dj. Golic (University of Belgrade, Yugoslavia) and Renato Menicocci (Fondazione Ugo Bordini, Italy)

11:30-12:00 Differential Fault Analysis of Secret Key Cryptosystems
Eli Biham (Technion, Israel) and Adi Shamir (Weizmann Institute of Science, Israel)

12:00-12:30 Cryptanalysis of the Cellular Message Encryption Algorithm
David Wagner (University of California at Berkeley, USA), Bruce Schneier (Counterpane Systems, USA), and John Kelsey (Counterpane Systems, USA)

12:30-2:00 Lunch, De La Guerra Commons

Adjourn

The information at this site is Copyright by the International Association for Cryptologic Research.