Workshops

Summer 2015

The Mathematics of Modern Cryptography

Jul 6, 2015 to Jul 10, 2015

Return to event »

Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

Monday, July 6th, 2015
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–11:00 am		Fully Homomorphic Encryption and Signatures Daniel Wichs, Northeastern University and Zvika Brakerski, Weizmann Institute
11:00 am–11:30 am		Break
11:30 am–1:00 pm		Attribute-Based and Predicate Encryption Vinod Vaikuntanathan, Massachusetts Institute of Technology and Hoeteck Wee, École Normale Supérieure Paris
1:00 pm–3:00 pm		Lunch
3:00 pm–4:30 pm		Historical Talk on Lattice-Based Cryptography Daniele Micciancio, UC San Diego
4:30 pm–5:30 pm		Reception

Tuesday, July 7th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Cryptography from Ideal Lattices [and Discussion] Damien Stehlé, École Normale Supérieure de Lyon
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling Noah Stephens-Davidowitz, New York University and Daniel Dadush, CWI, Amsterdam
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Algebraic Algorithms for LWE Ludovic Perret, Université Pierre et Marie Curie
2:30 pm–3:00 pm		Attacks on Ring-LWE Kristin Lauter, Microsoft Research Redmond
3:00 pm–3:30 pm		Break
3:30 pm–4:15 pm		How Diffie-Hellman Fails in Practice Nadia Heninger, University of Pennsylvania

Wednesday, July 8th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Arithmetic Cryptography Benny Applebaum, Tel Aviv University
10:30 am–11:00 am		Break
11:00 am–11:30 am		Time-Lock Puzzles from Randomized Encodings Nir Bitansky, Massachusetts Institute of Technology
11:30 am–12:00 pm		Output-Compressing Randomized Encodings and Applications Huijia (Rachel) Lin, UC Santa Barbara
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Somewhat Homomorphic Encryption via Number Fields and Finite Fields Jeff Hoffstein, Brown University
2:30 pm–3:00 pm		Efficient RKA-Secure KEM Scheme Against Invertible Functions Keita Xagawa , NTT Secure Platform Laboratories
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		TESLA: Tightly Secure, Efficient Signature Scheme from Standard Lattices Nina Bindel, Technische Universität Darmstadt
4:00 pm–4:25 pm		An Improved BKW Algorithm for LWE Paul Kirchner, École Normale Supérieure Paris and UC San Diego
4:30 pm–4:55 pm		The Preprocessing of Lattice Point Enumeration Michael Walter, UC San Diego

Thursday, July 9th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics Allison Bishop, Columbia University
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Non-Malleable Codes in the Split-State Model Yevgeniy Dodis, New York University
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Finding Short Generators of Principal Ideals Chris Peikert, Georgia Institute of Technology
2:30 pm–3:00 pm		Lattices with Symmetry Alice Silverberg, University of California, Irvine

Friday, July 10th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 pm		Graph-Induced Multilinear Maps from Lattices Shai Halevi, IBM T.J. Watson Research Center
10:15 am–10:45 am		Break
10:45 am–11:30 am		Multilinear Maps Over the Integers: From Design to Security Tancrède Lepoint, CryptoExperts
11:30 am–12:00 pm		Discussion on Multilinear Maps, Assumptions and Attacks
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Cryptography via Burnside Groups Antonio Nicolosi, Stevens Institute of Technology and Nelly Fazio, City University of New York