IACR logo

TCC 2006

March 4-7 2006, Columbia University
New York, NY USA

Final Program

All talks were held in Davis hall, at the entrance level of the Schapiro Center.

Program at-a-glance Saturday Mar 4 Sunday Mar 5 Monday Mar 6 Tuesday Mar 7
Morning I   Zero-knowledge SS & MPC (I) OWFs & friends
Morning II   Primitives UC-security SS & MPC (II)
Afternoon I   Assumptions & models Tutorial: BB separations PRFs & encryption
Afternoon II   Bounded retrieval model,
Tutorial: non-BB techniques  
Evening Reception Rump session    

Saturday, March 4 2006

7 - 9pm   Reception

Held at the Carleton Lounge, 1st floor of the Mudd Building, Columbia University.

Sunday, March 5 2006

8am   Registration opens & Breakfast

8:45   Opening remarks

9 - 10:15   Zero-Knowledge (chair: Yehuda Lindell)

Concurrent Zero Knowledge without Complexity Assumptions
Daniele Micciancio (UCSD) and Shien Jin Ong (Harvard) and Amit Sahai (UCLA) and Salil Vadhan (Harvard)
Interactive Zero-Knowledge with Restricted Random Oracles
Moti Yung (RSA Labs and Columbia Univ.) and Yunlei Zhao (Fudan Univ.)
Non-Interactive Zero-Knowledge from Homomorphic Encryption
Ivan Damgaard (Univ. of Aarhus) and Nelly Fazio and Antonio Nicolosi (NYU)

10:15 - 10:45 Morning break

10:45 - 12:25 Primitives (chair: John Mitchell)

Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
Adam Bender and Jonathan Katz and Ruggero Morselli (Univ. of Maryland, College Park)
Efficient Blind and Partially Blind Signatures Without Random Oracles
Tatsuaki Okamoto (NTT Labs)
Key Exchange Using Passwords and Long Keys
Vladimir Kolesnikov and Charles Rackoff (Univ. of Toronto)
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
Dario Catalano (ENS) and Yevgeniy Dodis (NYU) and Ivan Visconti (Univ. of Salerno)

12:25 - 2pm Lunch (Carleton Lounge, 1st floor of the Mudd Building)

2 - 3:15 Assumptions and models (chair: Daniele Micciancio)

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Chris Peikert (MIT) and Alon Rosen (Harvard)
On Error Correction in the Exponent
Chris Peikert (MIT)
On the Relation Between the Ideal Cipher and the Random Oracle Models
Yevgeniy Dodis and Prashant Puniya (NYU)

3:15 - 3:45 Afternoon break

3:45 - 4:35 The bounded-retrieval model (chair: Eyal Kushilevitz)

Intrusion-Resilience via the Bounded-Storage Model
Stefan Dziembowski (Warsaw University and CNR Pisa)
Perfectly Secure Password Protocols in the Bounded Retrieval Model
Giovanni Di Crescenzo (Telcordia) and Richard Lipton (Georgia Tech.) and Shabsi Walfish (NYU)

4:35 - 5:25 Privacy (chair: Eyal Kushilevitz)

Polylogarithmic Private Approximations and Efficient Matching
Piotr Indyk (MIT) and David Woodruff (MIT and Tsinghua Univ.)
Calibrating Noise to Sensitivity in Private Data Analysis
Cynthia Dwork and Frank McSherry (Microsoft) and Kobbi Nissim (Ben-Gurion Univ.) and Adam Smith (Weizmann)

7:30 - 10pm Business meetings and rump Session (chair: Charlie Rackoff)

Monday, March 6 2006

8:15am Breakfast

9 - 10:15 Secret-sharing and multi-party computation I (chair: Stefan Dziembowski)

Unconditionally Secure Constant-Rounds Multi-Party Computation for Equality, Comparison, Bits and Exponentiation
Ivan Damgaard and Matthias Fitzi (Univ. of Aarhus) and Eike Kiltz (CWI Amsterdam) and Jesper Buus Nielsen and Tomas Toft (Univ. of Aarhus)
Efficient Multi-Party Computation with Dispute Control
Zuzana Beerliovà and Martin Hirt (ETH Zurich)
Round-Optimal and Efficient Verifiable Secret Sharing
Matthias Fitzi (Aarhus Univ.) and Juan Garay (Bell Labs) and Shyamnath Gollakota (IIT Madras) and C. Pandu Rangan (IIT Madras) and Kannan Srinathan (International Institute of Information Technology, Hyderabad, India)

10:15 - 10:45 Morning break

10:45 - 12:25 Universally-composible security (chair: Jonathan Katz)

Generalized Environmental Security from Number Theoretic Assumptions
Tal Malkin (Columbia Univ.) and Ryan Moriarty (UCLA) and Nikolai Yakovenko (Google)
Games and the Impossibility of Realizable Ideal Functionality
Anupam Datta and Ante Derek and John C. Mitchell and Ajith Ramanathan (Stanford Univ.) and Andre Scedrov (Univ. of Pennsylvania)
Universally Composable Symbolic Analysis of Mutual Authentication and Key Exchange Protocols
Ran Canetti (IBM) and Jonathan Herzog (MITRE)
Resource Fairness and Composability of Cryptographic Protocols
Juan Garay (Bell Labs) ,Phillip MacKenzie (Google) and Manoj Prabhakaran (Univ. of Illinois, Urbana-Champaign) and Ke Yang (Google)

12:25 - 2pm Lunch (7th floor of Schapiro Center)

2 - 3:30 Tutorial I: On Black-Box Separations in Cryptography

Speaker: Omer Reingold

3:30 - 4 Afternoon break

4 - 5:30 Tutorial II: On Non-Black-Box Proofs of Security

Speaker: Boaz Barak

Tuesday, March 7 2006

8:15am Breakfast

9 - 10:15 One-way functions and friends (chair: Manoj Prabhakaran)

Finding Pessiland
Hoeteck Wee (UC Berkeley)
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
Thomas Holenstein (ETH Zurich)
On the Complexity of Parallel Hardness Amplification for One-Way Functions
Chi-Jen Lu (Academia Sinica)

10:15 - 10:45 Morning break

10:45 - 12:25 Secret-sharing and multi-party computation II (chair: Adam Smith)

On Matroids and Non-ideal Secret Sharing
Amos Beimel and Noam Livne (Ben-Gurion Univ.)
Secure Computation with Partial Message Loss
Chiu-Yuen Koo (Univ. of Maryland, College Park)
Communication Efficient Secure Linear Algebra
Kobbi Nissim and Enav Weinreb (Ben-Gurion Univ.)
Threshold and Proactive Pseudo-Random Permutations
Yevgeniy Dodis (NYU) and Aleksandr Yampolskiy (Yale) and Moti Yung (RSA Labs and Columbia Univ.)

12:25 - 2pm Lunch (7th floor of Schapiro Center)

2 - 3:15 Pseudo-random functions and encryption (chair: Tal Malkin)

PRF Domain Extension Using DAGs
Charanjit S. Jutla (IBM)
Chosen-Ciphertext Security from Tag-Based Encryption
Eike Kiltz (CWI Amsterdam)
Separating Sources for Encryption and Secret Sharing
Yevgeniy Dodis (NYU) and Krzysztof Pietrzak and Bartosz Przydatek (ETH Zurich)