Workshop III: Foundations of secure multi-party computation and zero-knowledge and its applications - IPAM

Workshop III: Foundations of secure multi-party computation and zero-knowledge and its applications

Part of the Long Program Securing Cyberspace: Applications and Foundations of Cryptography and Computer Security
November 13 - 17, 2006

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, November 13, 2006

Morning Session

08:00-09:45
Check-In/Light Breakfast (Hosted by IPAM)
09:45-10:00
Welcome and Opening Remarks
10:00-11:00
Jens Groth (University College London)
New Techniques for Non-interactive Zero-Knowledge
11:00-11:15
Break
11:15-12:15
Amit Sahai (University of California, Los Angeles (UCLA))
Title not available

Afternoon Session

12:15-14:00
Lunch (on your own)
14:00-15:00
Hoeteck Wee (Queens College, CUNY)
One Way Permutations, Interactive Hashing and Statistically Hiding Commitments
15:00-15:30
Break
15:30-16:30
Nishanth Chandran (University of California, Los Angeles (UCLA))
Covert Multi-party Computation
16:30-17:30
Enav Weinreb (Technion - Israel Institute of Technology)
Private Approximation of Search Problems
17:30-18:30
Wine/Cheese Reception (Hosted by IPAM)

Tuesday, November 14, 2006

Morning Session

09:00-10:00
Continental Breakfast
10:00-11:00
Tal Rabin (IBM Thomas J. Watson Research Center)
Information-Theoretic Security and Security under Composition
11:00-11:15
Break
11:15-12:15
Leonid Reyzin (Boston University)
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

Afternoon Session

12:15-14:00
Lunch (on your own)
14:00-15:00
Adam Smith (Pennsylvania State University)
Cryptography with Quantum Data
15:00-15:30
Break
15:30-16:30
Jonathan Katz (University of Maryland)
On Expected Constant-Round Protocols for Broadcast
16:30-17:30
Chiu-Yuen Koo (University of Maryland)
Round-Efficient Multi-Party Computation in Point-to-Point Networks

Wednesday, November 15, 2006

Morning Session

09:00-10:00
Continental Breakfast
10:00-11:00
Manoj Prabhakaran (University of Illinois at Urbana-Champaign)
Angels and Monitors
11:00-11:15
Break
11:15-12:15
Ran Canetti (Tel Aviv University)
Universally Composable Security with Global Setup

Afternoon Session

12:15-14:00
Lunch (on your own)
14:00-15:00
Danny Harnik (IBM Israel Scientific Center)
On the Compressibility of NP Instances and Cryptographic Applications
15:00-15:30
Break
15:30-16:30
Rafael Pass (Cornell University)
Precise Zero Knowledge
16:30-17:30
Ivan Visconti (Università di Salerno)
Concurrent Non-Malleable Witness Indistinguishability

Thursday, November 16, 2006

Morning Session

09:00-10:00
Continental Breakfast
10:00-11:00
Yevgeniy Dodis (New York University)
Does Privacy Require True Randomness?
11:00-11:15
Break
11:15-12:15
Serge Fehr (CWI (Center for Mathematics and Computer Science))
Combinatorial Codes for Detection of Algebraic Manipulation

Afternoon Session

12:15-14:00
Lunch (on your own)
14:00-15:00
Anna Lysyanskaya (Brown University)
On Signatures of Knowledge
15:00-15:30
Break
15:30-16:30
Salil Vadhan (Harvard University)
The Complexity of Zero Knowledge
16:30-17:30
Shien Jin Ong (Harvard University)
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function

Friday, November 17, 2006

Morning Session

09:00-10:00
Continental Breakfast
10:00-11:00
Eyal Kushilevitz (Technion - Israel Institute of Technology)
ZK from MPC
11:00-11:15
Break
11:15-12:15
Juan Garay (AT&T Labs-Research)
Towards Optimal and Efficient Perfectly Secure Message Transmission

Afternoon Session

12:15-14:00
Lunch (on your own)
14:00-15:00
Alon Rosen (Harvard University)
Input-Indistinguishable Computation
15:00-15:30
Break
15:30-16:30
Stanislaw Jarecki (University of California, Irvine (UCI))
Efficient Secure Two-Party Computation on Committed Inputs
16:30-17:30
Benny Applebaum (Technion - Israel Institute of Technology)
On Pseudorandom Generators with Linear Stretch in NC0
Printable Version