Paper 2023/910
Amortized Functional Bootstrapping in less than 7ms, with polynomial multiplications
Abstract
Amortized bootstrapping offers a way to refresh multiple ciphertexts of a fully homomorphic encryption scheme in parallel more efficiently than refreshing a single ciphertext at a time. Micciancio and Sorrell (ICALP 2018) first proposed the technique to bootstrap
Note: Minor editorial changes and typo fixing.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2023
- Keywords
- Fully Homomorphic EncryptionBootstrapping
- Contact author(s)
-
zeyu liu @ yale edu
yw3736 @ columbia edu - History
- 2023-10-07: revised
- 2023-06-12: received
- See all versions
- Short URL
- https://ia.cr/2023/910
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/910, author = {Zeyu Liu and Yunhao Wang}, title = {Amortized Functional Bootstrapping in less than 7ms, with $\tilde{O}(1)$ polynomial multiplications}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/910}, year = {2023}, url = {https://eprint.iacr.org/2023/910} }