The second, third, and fourth talks at CRYPTOGRAPHY DAY are 1:30-5 pm in NS2, room 2210. 

CRYPTOGRAPHY DAY is a one-day meeting on the Mathematics of Cryptography sponsored by the Alfred P. Sloan Foundation.  All are encouraged/welcome to attend!

Note the change in room between the morning and afternoon talks.

Schedule:

11-12: Daniele Micciancio speaking on "Modern Lattice Cryptography: an introduction" in RH 440R

1:30-2:30: Kristin Lauter speaking on "Practical Applications of Homomorphic Encryption" in Natural Sciences II, room 2201

2:45-3:45: Daniele Micciancio speaking on "FHEW: Bootstrapping  Homomorphic Encryption in less than a Second" in Natural Sciences II, room 2201

4-5: Kristin Lauter speaking on "Some recent attacks on lattice-based crypto" in Natural Sciences II, room 2201

We will discuss the paper:
"A Simple Framework for Noise-Free Construction of Fully Homomorphic Encryption from a Special Class of Non-Commutative Groups" by Koji Nuida
 https://eprint.iacr.org/2014/097.pdf

Lattices have become a topic of active research in computer science, mathematics, etc. They are used as an algorithmic tool to solve a wide variety of problems. In this talk, we introduce some basic knowledge on lattices and some applications to cryptography and cryptanalysis.

Algebraic complexity theory is the study of the computational difficulty of infinite families of polynomials -- a generalization of the computational complexity of decision problems. In this theory, there are analogues of the usual complexity classes P and NP, as well as different NP-complete problems. The main aim is to find complexity lower bounds for certain specific families, such as the families for matrix multiplication and the permanent family. There are different approaches using algebraic geometry and representation theory to attack such lower bound problems. This talk will be a brief introduction to this area and its central problems.