DIMACS Workshop on Cryptographic Protocols in Complex Environments
May 15 - 17, 2002
DIMACS Center, Rutgers University, Piscataway, NJ
- Organizers:
- Ran Canetti, IBM Watson Research Center, canetti@watson.ibm.com
- Ueli Maurer, ETH Zurich, maurer@inf.ethz.ch
- Rafail Ostrovsky, Telcordia Technologies, rafail@research.telcordia.com
Presented under the auspices of the Special Focus on Next Generation Networks Technologies and Applications.
Workshop Program: (Preliminary)
Wednesday, May 15
8:00 - 8:45 Breakfast & Registration
8:45 - 9:00 Welcome & Greeting
Fred S. Roberts, Director of DIMACS
9:00 - 9:40 Proof Systems and Chosen-Ciphertext Security.
Amit Sahai, Princeton
9:40 - 10:20 Efficient and Non-Malleable Proofs of Plaintext
Knowledge and Applications
Jonathan Katz, Columbia University
10:20 - 11:00 Coin-Tossing With a Man in the Middle, or
Realizing the Shared Random String Model
Boaz Barak, Weizmann Institue
11:00 - 11:10 Break
11:10 - 11:50 On designing efficient cryptographic protocols for the
Internet
Philip MacKenzie, Bell-Labs Lucent
11:50 - 12:30 Interactive CCA2-Secure Encryption From Any
Semantically-Secure Envcyption
Michael Rabin, Harvard University
12:30 - 2:00 Lunch
2:00 - 2:40 Self-Referential Cryptography
Rafail Ostrovsky, Telcordia
2:40 - 3:20 Key Insulated Public-Key Crytosystems
Yevgeniy Dodis, NYU
3:20 - 3:50 Break
3:50 - 4:30 On the efficiency of two generic cryptographic
constructions
Luca Trevisan, Berkeley
4:30 - 5:10 Exploring the Worlds Between Minicrypt and Cryptomania
Omer Reingold, AT&T
5:10 - 5:50 Two Formal Views of Authenticated Group Diffie-Hellman
Key Exchange
Jean-Jacques Quisquater
Thursday, May 16th
8:00 - 9:00 Breakfast & Registration
9:00 - 9:40 Recent Advances in Byzantine Agreement
Matthias Fitzi, ETH
9:40 - 10:20 On the Composition of Authenticated Byzantine Agreement
Tal Rabin
10:20 - 10:30 Break
10:30 - 11:10 Fault Tolerant Computation without Broadcast
Shafi Goldwasser, MIT, Weizmann
11:10 - 11:50 Reusable Time-Lines
Juan Garay, Bell-Labs Lucent
11:50 - 12:30 Tight Bounds for Shared Memory Systems Accessed by
Byzantine Processes
Rebecca Wright, DIMACS
12:30 - 2:00 Lunch
2:00 - 2:40 Recent advances in Information-Theoretic PIR
Eyal Kushilevitz, Technion
2:40 - 3:20 Secure Multiparty Computation of Approximations
Tal Malkin, AT&T
3:20 - 3:50 Break
3:50 - 4:30 Optimal Black-Box Secret Sharing over Arbitrary Abelian
Groups
Serge Fehr, Aarhus University
4:30 - 5:10 Round-Efficient secure computation via randomizing
polynomials
Yuval Ishai, Princeton and Technion
5:10 - 5:50 Tight Security Proofs for the Bounded-Storage Model
Stefan Dziembowski, ETH
Friday, May 17
8:00 - 9:00 Breakfast & Registration
9:00 - 9:40 Securing Internet Sealed-Bid Auctions
Benny Pinkas, Intertrust
9:40 - 10:20 Coercion-free Voting
Ari Juels, RSA Research
10:20 - 10:30 Break
10:30 - 11:10 Key Management for IPsec: Background and Challenges
Angelos D. Keromytis, Columbia University
11:10 - 11:50 Fractal representation and traversal of graphs
Markus Jakobson, RSA Research
11:50 - 12:30 SHIP: Secure Human Input Protocol
Stuart Haber, Intertrust
12:30 - 2:00 Lunch
2:00 - 2:40 A very simple secure multi-party computation protocol
Ueli Maurer, ETH
2:40 - 3:20 Secure Multi-party Quantum Computation
Claude Crepeau
3:20 - 3:50 Break
3:50 - 4:30 Deniable Ring Authentication
Moni Naor, Weizmann Institute
4:30 - 5:10 TBA
Cynthia Dwork, Microsoft Research
5:10 - 5:50 Agents' privacy in distributed algorithmic mechanisms
Joan Feigenbaum, Yale
5:50 - 6:00 Break
6:00 - 7:30 Banquet
Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on January 18, 2002.