Mathematics of Information-Theoretic Cryptography

February 28 - March 4, 2011

Schedule


Monday, February 28, 2011

9:00 - 9:40
Yuval Ishai (Technion - Israel Institute of Technology)

Why are we here?

10:05 - 10:45
Ronald Cramer (CWI Amsterdam & Mathematical Institute, Leiden University)

The Arithmetic Codex

11:10 - 11:50
Alp Bassa (Nanyang Technological University)

How many rational points can a curve over a finite field have?

2:00 - 2:40
Chaoping Xing (Nanyang Technological University)

 

3:05 - 3:45
Ignacio Cascudo (CWI (Center for Mathematics and Computer Science))

The Torsion Limit for Algebraic Function Fields and Applications in Cryptography and Complexity

4:10 - 4:50

Tuesday, March 1, 2011

9:00 - 9:40
10:05 - 10:45
David Zuckerman (University of Texas at Austin)

Randomness Extraction: A Survey

11:10 - 11:50
2:00 - 2:40
Sergey Yekhanin (Microsoft Research)

Locally decodable codes.

3:05 - 3:45
Iwan Duursma (University of Illinois at Urbana-Champaign)

Coding theory aspects of linear secret sharing schemes.

4:10 - 4:50
Omer Reingold (Microsoft Research)

The Many Entropies of One-Way Functions


Wednesday, March 2, 2011

9:00 - 9:40
Madhu Sudan (Microsoft Research New England)

Local List Decoding

10:05 - 10:45
11:10 - 11:50
Kristin Lauter (Microsoft Research)

Elliptic Curve Cryptography and Applications.

2:00 - 2:40
Arnaldo Garcia (Institute of Pure and Applied Mathematics (IMPA))

On explicit towers over finite fields


Thursday, March 3, 2011

9:00 - 9:40
10:05 - 10:45
11:10 - 11:50
Yevgeniy Dodis (New York University)

Leftover Hash Lemma, Revisited

2:00 - 2:40
Rafail Ostrovsky (University of California, Los Angeles (UCLA))

Improved Fault Tolerance and Secure Computation on Sparse Networks.

3:05 - 3:45
Krzysztof Pietrzak (CWI (Center for Mathematics and Computer Science))

Subspace LWE & Applications

4:10 - 4:50
Amit Sahai (University of California, Los Angeles (UCLA))

Potent Tree Codes and Their Applications


Friday, March 4, 2011

9:00 - 9:40
Michael Zieve (University of Michigan)

Automorphism groups of curves

10:05 - 10:45
Jürg Wullschleger (University of Montreal)

Constant-Rate Oblivious Transfer from Noisy Channels

11:10 - 11:50
Serge Fehr (CWI (Center for Mathematics and Computer Science))

Secure Authentication from a Weak Key, Without Leaking Information

2:00 - 2:40
Frantisek Matus (Czech Academy of Sciences (AVCR))

Almost entropic matroids

3:05 - 3:45
4:10 - 4:50
Manoj Prabhakaran (University of Illinois at Urbana-Champaign)

Assisted Common Information and its Applications to Secure Two-Party Computation.