This series of talks was part of the Cryptography Boot Camp. Videos for each talk area available through the links above.
Speaker: Sanjam Garg, UC Berkeley
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.