Lattice cryptography - from computational complexity to fully homomorphic encryption Introduction 1 So this first of all thanks for coming back from lunch, it's always an achievement. I want to say that this is a special talk within the workshop here at Simons we have a historical cryptopapers se...

[Dan Boneh]( (see also [1]( slides: original video: original video sha256 hash: 1351217725741cd3161de95905da7477b9966e55a6c61686f7c88ba5a1ca0414 Okay, so um I'm very happy to introduce another speaker in this historical papers series seminar seminar series which is organized by Daniel Wigs a...

* * * * slides: * slides (again): * more: Okay, thanks. I want to begin by thanking the organizers, especially the tall guy for allowing me to be here. This talk will be talking about a research area where the goal is deployable systems for verifiable computation for probabilistic proofs like...

Thank you very much. I would like to thank the organizers for giving this opportunity to learn so much from my peers and colleagues some of which are here. This is a wonderful survey of many of the works in this area. As I was sitting here, I was in real-time adjusting my slides to minimize the over...

Historical Papers in Cryptography Seminar Series, Simons Institute She has received several awards, she is a source of incredibly creative ideas, very effective advisor and metor, and I am always inspired when she speaks. So please welcome her. There is no better place to give this historical talk...