(2020). The CKKS (a.k.a. HEAAN) FHE Scheme. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/heaan-fhe
MLA
The CKKS (a.k.a. HEAAN) FHE Scheme. The Simons Institute for the Theory of Computing, Apr. 30, 2020, https://simons.berkeley.edu/talks/heaan-fhe
BibTex
@misc{ scivideos_15661,
doi = {},
url = {https://simons.berkeley.edu/talks/heaan-fhe},
author = {},
keywords = {},
language = {en},
title = {The CKKS (a.k.a. HEAAN) FHE Scheme},
publisher = {The Simons Institute for the Theory of Computing},
year = {2020},
month = {apr},
note = {15661 see, \url{https://scivideos.org/index.php/Simons-Institute/15661}}
}
In this talk, I will present recent progresses on the design and implementation of Homomorphic Encryption for Arithmetic of Approximate Numbers (HEAAN), which supports encrypted computation with errors.
I will also describe the advantages of HEAAN in practice as well as its bootstrapping method to achieve approximate fully homomorphic encryption.
