Speaker: Oded Regev, CIMS
Location: Warren Weaver Hall 1302
Date: October 12, 2012, 11:30 a.m.
Host: Mehryar Mohri
Most of the cryptographic protocols used in everyday life are based on number theoretic problems such as integer factoring. We will give an introduction to lattice-based cryptography, a relatively recent form of cryptography offering many advantages over the traditional number-theoretic-based one. The talk will mainly focus on the so-called Learning with Errors (LWE) problem. This problem has turned out to be an amazingly versatile basis for cryptographic constructions, with tens of applications, including a recent celebrated work on fully homomorphic encryption by Gentry and others. In addition to applications, we will also mention very recent work providing a better understanding of the security of the problem.
The talk does not assume any prior knowledge in cryptography or lattices.
In-person attendance only available to those with active NYU ID cards.