yao@PRINCETON.EDU (Andrew Yao) (09/24/90)
Dear Colleagues:
As part of the DIMACS Special Year on "Complexity Theory of
Interactive Computation," a cryptography workshop will be held during
October 1-4, 1990 at Princeton. The program of the workshop is
attached below. All technical sessions will take place in the
Computer Science Department of Princeton University. If you would
like further information, please contact Ms. Winnie Waring at
wbw@cs.princeton.edu (phone number 609-258-5330).
Sincerely,
The Organizers
Manuel Blum
Shafi Goldwasser
Silvio Micali
Andrew Yao
-----------------------------------------------------------------------------
CRYPTOGRAPHY WORKSHOP
---------------------
MONDAY (Oct 1)
------
9:30-10:00 COFFEE
10:00-10:30 N. Nisan --
Shen's new proof of IP=PSPACE
10:45-11:30 C. Lund --
Non Deterministic Exponential Time Has Two-Prover
Interactive Proofs
11:30-2:00 LUNCH
2:00-2:30 M. Bellare --
Randomness/Communication - Efficiency in Arthur-Merlin Games
2:30-3:00 J. Kilian --
Strong Separation Models of Multi Prover Interactive Proofs
3:00-3:30 COFFEE
3:30-4:00 J. Feigenbaum --
Instance Hiding, Zero Knowledge Proof Systems
4:00-4:30 A. Wigderson --
BPP has weak subexponential simulation unless
exponential time has publishable proofs
TUESDAY (Oct 2)
9:30-10:00 COFFEE
10:00-10:45 U. Feige --
Multiple Non Interactive Zero-Knowledge Proofs Based on a
Single Random String
11:00-11:30 M. Naor --
Non-Transferable Bit commitments and Public Key Cryptosystems
11:45-12:15 R. Ostrovsky --
On the complexity of Asymmetric Games
12:15-2:00 LUNCH
2:00 -2:30 E. Kushilevitz --
Private Computations over the integers
2:30-3:00 P. Rogaway --
Security with low communication overhead
3:00-3:30 COFFEE
3:30-4:00 L. Levin --
Security Preserving Amplification of Hardness
4:00-5:00 OPEN PROBLEMS SESSION
Evening Dinner at Prospect House
WEDNESDAY (Oct 3)
9:30-10:00 COFFEE
10:00-10:45 S. Micali--
Definitions for Secure Protocols
11:00-11:30 M. Rabin --
Cryptography without Secrets
11:45-12:15 P. Winkler --
Combinatorial Cryptology and the "Two-Sheriffs" problem
---- FREE AFTERNOON FOR OPEN SESSIONS-----
THURSDAY (Oct 4)
9:30-10:00 COFFEE
10:00-10:45 J. Stearn--
Can one use error-Correcting Codes in Cryptography
11:00-11:45 C. Schnorr--
Factoring Integers via Lattice Basis Reduction
11:45-2:00 LUNCH
2:00-2:30 U. Maurer--
A Provably Secure and Practical Key Distribution Protocol
2:30-3:00 S. Rudich --
The use of interaction in public cryptosystems
3:00-3:30 COFFEE
3:30-4:00 M. Luby --
Checking: Self-Testing/Correcting Programs - Basics
4:00-4:30 R. Rubinfeld --
Checking: Self-Testing/Correcting Programs - Extensions