Contemporary Methods in Cryptography - IPAM

Contemporary Methods in Cryptography

January 9 - 13, 2002

Schedule

All times in this Schedule are Pacific Time (PT)

Thursday, January 10, 2002

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Dan Boneh (Stanford University)
New Tools in Cryptography from Algebraic Geometry
09:50-10:00
Break
10:00-10:50
Cynthia Dwork (Harvard University)
2-Round Zero Knowledge and Proof Auditors
10:50-11:00
Break
11:00-11:50
Ravi Kumar (IBM Almaden Research Center)
Title not available
11:50-14:00
Lunch (on your own)

Afternoon Session

14:00-14:50
Daniele Micciancio (University of California, San Diego)
From Ajtai-Dwork to NTRU: the design of practical lattice based cryptosystems
14:50-15:10
Break
15:10-16:00
Nick Howgrave-Graham (NTRU Cryptosystems)
Using lattices for Crypto
16:00-16:10
Break
16:10-17:00
Noam Elkies (Harvard University)
Lattice reduction and approximate Diophantine equations: Further applications and results
17:00
Dinner (Hosted by IPAM)

Friday, January 11, 2002

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Neal Koblitz (University of Washington)
Elliptic Curve Cryptography: which curves to use?
09:50-10:00
Break
10:00-10:50
Joseph Silverman (Brown University)
The Four Faces of Lifting for the Elliptic Curve Discrete Logarithm Problem
10:50-11:00
Break
11:00-11:50
Edlyn Teske (University of Waterloo, Canada)
On the Weil descent attack on the elliptic curve discrete logarithm problem
11:50-14:00
Lunch (on your own)

Afternoon Session

14:00-14:50
Kumar Murty (University of Toronto)
Elliptic curves and sieve methods
14:50-15:10
Break
15:10-16:00
Antoine Joux (Université Versailles/Saint Quentin-en-Yvelines)
The Function Field Sieve in GF(2^n)
16:00-16:10
Break
16:10-17:00
Kristin Lauter (Microsoft Research)
Attacking the Discrete Log Problem on Elliptic Curves from above

Saturday, January 12, 2002

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Dorian Goldfeld (Columbia University)
A Linear Time Matrix Key Agreement Protocol
09:50-10:00
Break
10:00-10:50
Luca Trevisan (University of California, Berkeley (UC Berkeley))
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
10:50-11:00
Break
11:00-11:50
Kobbi Nissim (Ben Gurion University of the Negev)
Private approximation of NP-hard functions
11:50-14:00
Lunch (on your own)

Afternoon Session

14:00-14:50
Alice Silverberg (Ohio State University)
The best and worst of supersingular abelian varieties in cryptography
14:50-15:10
Break
15:10-16:00
David Wagner (UC Berkeley)
Analysis and design of symmetric ciphers
16:00-16:10
Break
16:10-17:00
Moni Naor (Weizmann Institute of Science)
Deniable Ring Authentication
Printable Version