Mathematics of Information-Theoretic Cryptography - IPAM

Mathematics of Information-Theoretic Cryptography

February 28 - March 4, 2011

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, February 28, 2011

Morning Session

08:00-08:50
Check-In/Light Breakfast (Hosted by IPAM)
08:50-09:00
Welcome and Opening Remarks
09:00-09:40
Yuval Ishai (Technion - Israel Institute of Technology)
Why are we here?
09:50-10:05
Break
10:05-10:45
Ronald Cramer (CWI Amsterdam & Mathematical Institute, Leiden University)
The Arithmetic Codex
10:55-11:10
Break
11:10-11:50
Alp Bassa (Nanyang Technological University)
How many rational points can a curve over a finite field have?

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:40
Chaoping Xing (Nanyang Technological University)
Title not available
14:50-15:05
Break
15:05-15:45
Ignacio Cascudo (CWI (Center for Mathematics and Computer Science))
The Torsion Limit for Algebraic Function Fields and Applications in Cryptography and Complexity
15:55-16:10
Break
16:10-16:50
Ivan Damgård (Aarhus University)
Using Information Theoretic MAC's in Multiparty Computation with Dishonest Majority.
17:00-18:30
Reception (Location: IPAM Lobby)

Tuesday, March 1, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:40
Carles Padro (Nanyang Technological University)
On the Optimization of Secret Sharing Schemes for General Access Structures
09:50-10:05
Break
10:05-10:45
David Zuckerman (University of Texas at Austin)
Randomness Extraction: A Survey
10:55-11:10
Break
11:10-11:50
Leonid Reyzin (Boston University)
Information-Theoretic Key Agreement from Close Secrets: A Survey.

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:40
Sergey Yekhanin (Microsoft Research)
Locally decodable codes.
14:50-15:05
Break
15:05-15:45
Iwan Duursma (University of Illinois at Urbana-Champaign)
Coding theory aspects of linear secret sharing schemes.
15:55-16:10
Break
16:10-16:50
Omer Reingold (Microsoft Research)
The Many Entropies of One-Way Functions

Wednesday, March 2, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:40
Madhu Sudan (Microsoft Research New England)
Local List Decoding
09:50-10:05
Break
10:05-10:45
Yael Kalai (Microsoft Research)
Cryptography with Tamperable and Leaky Memory
10:55-11:10
Break
11:10-11:50
Kristin Lauter (Microsoft Research)
Elliptic Curve Cryptography and Applications.

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:40
Arnaldo Garcia (National Institute for Pure and Applied Mathematics, Brazil)
On explicit towers over finite fields
14:50-15:05
Break
15:05-17:30
Hot Topic Session

Thursday, March 3, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:40
Amos Beimel (Ben Gurion University of the Negev)
Using Secret Sharing to Construct Protocols for Multiparty Coin Toss With Dishonest Majority
09:50-10:05
Break
10:05-10:45
Venkat Guruswami (Carnegie-Mellon University)
Bridging Shannon and Hamming: Codes for computationally simple channels
10:55-11:10
Break
11:10-11:50
Yevgeniy Dodis (New York University)
Leftover Hash Lemma, Revisited

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:40
Rafail Ostrovsky (University of California, Los Angeles (UCLA))
Improved Fault Tolerance and Secure Computation on Sparse Networks.
14:50-15:05
Break
15:05-15:45
Krzysztof Pietrzak (CWI (Center for Mathematics and Computer Science))
Subspace LWE & Applications
15:55-16:10
Break
16:10-16:50
Amit Sahai (University of California, Los Angeles (UCLA))
Potent Tree Codes and Their Applications

Friday, March 4, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:40
Michael Zieve (University of Michigan)
Automorphism groups of curves
09:50-10:05
Break
10:05-10:45
Jürg Wullschleger (University of Montreal)
Constant-Rate Oblivious Transfer from Noisy Channels
10:55-11:10
Break
11:10-11:50
Serge Fehr (CWI (Center for Mathematics and Computer Science))
Secure Authentication from a Weak Key, Without Leaking Information

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:40
Frantisek Matus (Czech Academy of Sciences (AVCR))
Almost entropic matroids
14:50-15:05
Break
15:05-15:45
Amnon Ta-shma (Tel Aviv University)
Constructing Small-Bias Sets from Algebraic-Geometric Codes
15:55-16:10
Break
16:10-16:50
Manoj Prabhakaran (University of Illinois at Urbana-Champaign)
Assisted Common Information and its Applications to Secure Two-Party Computation.
Printable Version