DIMACS Workshop on Cryptography and Intractability

March 20 - 22, 2000
DIMACS Center, Rutgers University, Piscataway, NJ

Moni Naor, Weizmann Institute of Science, naor@wisdom.weizmann.ac.il
Joe Kilian, NEC Research Institute, joe@research.nj.nec.com
Shafi Goldwasser, MIT and Weizmann Institute of Science, shafi@theory.lcs.mit.edu
Presented under the auspices of the DIMACS Special Year on Computational Intractability and the DIMACS Special Year on Networks.

Workshop Program:

Monday March 20th 2000

8:00-9:00   Breakfast and Registration

9:00-9:10   Welcome and Greeting:
            Mike Saks, Rutgers University
            Chair, Special Year Computational Intractability 

9:10-10:00  Things You Can't Do With A Random Function
            Steven Rudich, CMU

10:00-10:50 The Cryptographic Uses of Oracle Separations
            Dan Simon, Microsoft

10:50-11:10 Break

11:10-12:00 Compressing Cryptographic Resources
            Yuval Ishai, DIMACS


2:00-2:50   Why We Need a Complexity Theory of Moderately-Hard Functions
            Moni Naor, Weizmann Institute

3:00-3:50   Zaps and Apps
            Cynthia Dwork, IBM Almaden

3:50-4:30   Break

4:20-5:10   Resettable Zero Knowledge
            Ran Canetti, IBM Watson

Tuesday March 21st 2000

8:00-9:10   Breakfast and Registration

9:10-10:00  Twenty Years of Lattice Reduction in Cryptology
            Jacques Stern, Ecole Normale Sup'erieure

10:00-10:50 Secure Multiparty Computation of Approximation
            Rebecca Wright, AT&T Research

10:50-11:10 Break

11:10-12:00 Sharing the Cost of Multicast Transmissions
            Joan Feigenbaum, AT&T Research


2:00-2:50   A Cryptographic Solution to a Game Theoretic Problem
            Yevgeniy Dodis, MIT

3:00-3:50   The All-or-Nothing Nature of Two-Party Secure Computation
            Tal Malkin, AT&T

3:50-4:30  Break

4:20-5:10  More General Completeness Theorems for Secure Two-Party Computation 
	   Joe Kilian, NECI

Wednesday March 22nd 2000

8:00-9:10   Breakfast and Registration

9:10-10:00  Computational Learning Theory and Cryptography: A Survey
            Michael Kearns, AT&T Labs

10:00-10:50 Magic Functions
            Omer Reignold, AT&T

11:10-12:00 TBA
            Richard Lipton, Princeton


2:00-3:00   Recent Results on Single Database Private Information Retrieval
            Rafail Ostrovsky, Telcordia Technologies

3:00-4:00   TBA
            Silvio Micali

Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on March 28, 2000.