(2020). Tutorial: Encrypted Computation from Lattices. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/tutorial-encrypted-computation-lattices
MLA
Tutorial: Encrypted Computation from Lattices. The Simons Institute for the Theory of Computing, Mar. 23, 2020, https://simons.berkeley.edu/talks/tutorial-encrypted-computation-lattices
BibTex
@misc{ scivideos_15487,
doi = {},
url = {https://simons.berkeley.edu/talks/tutorial-encrypted-computation-lattices},
author = {},
keywords = {},
language = {en},
title = {Tutorial: Encrypted Computation from Lattices},
publisher = {The Simons Institute for the Theory of Computing},
year = {2020},
month = {mar},
note = {15487 see, \url{https://scivideos.org/Simons-Institute/15487}}
}
Lattices have allowed us to realize several advanced notions of computation over encrypted data, notably fully homomorphic encryption, attribute-based encryption, as well as fully homomorphic signatures. In this tutorial, we will introduce and derive a simple equation at the core of all of these constructions.
