Abstract
I will describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. These new constructions radically enhance our tool set and open a floodgate of applications. I will present some of these applications. I will also describe some of the new attacks against these constructions and techniques for recovering from them. Joint work with Craig Gentry and Shai Halevi.
The second session of this talk will take place on Tuesday, May 19 from 11:00 am – 12:00 pm.