DIMACS Mixer Series - September 19, 2002

DIMACS, Room 401 CoRE Building

12:15 - 1:00    Lunch

1:00 - 1:40     Randomness-Optimal Characterizations of Two NP Proof Systems
                Giovanni Di Crescenzo, DIMACS member, Telcordia

1:40 - 1:45     Questions

1:45 - 2:05     Datascope - a new tool for Logical Analysis of Data (LAD)
                Sorin Alexe, Graduate Student, RUTCOR

2:05 - 2:10     Questions


2:10 - 2:30     Revealing Information While Preserving Privacy
                Irit Dinur, Post Doc at NEC
                (Joint work with Cynthia Dwork and Kobbi Nissim)
                
2:30 - 2:35     Questions

2:35 - 3:00     Coffee Break

3:00 - 3:20     Concurrent Zero Knowledge with Logarithmic Round-Complexity
                Manoj Prabhakaran, graduate student, Princeton
                (joint work with Alon Rosen and Amit Sahai)

3:20 - 3:25     Questions

3:25 - 3:45     Advanced notions of security for encryption
                Edith Elkind, graduate student, Princeton

3:45 - 3:50     Questions

3:50 - 4:30     What's new in primality testing
                Carl Pomerance, DIMACS member, Bell Labs

4:30 - 4:35     Questions