Faster Bootstrapping with Polynomial Error

By Jacob Alperin-Sheriff, Chris Peikert. Annual International Cryptology Conference, 2014

322 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/b1fc5460d005468ea2ef445f775528ac0b9f27ba

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Wei Dai
2. Kim Laine
3. Miran Kim
4. Yongsoo Song
5. Hao Chen
6. Andrey Kim
7. Jung Hee Cheon
8. Shai Halevi

In Computational Theory and Mathematics

1. Miran Kim
2. Yongsoo Song
3. Shai Halevi
4. Kim Laine
5. Andrey Kim
6. Kyoohyung Han
7. Jung Hee Cheon
8. Nicolas Gama

Citations in the corpus

• Homomorphic Encryption (2017, methodology): “Also, building on techniques from [20, 3], Ducas and Micciancio implemented bootstrapping for a (non packed) GSW-like scheme in less than a second [30].”
• OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022, methodology): “As explained in [47], the DM and CGGI (functional) bootstrapping procedures are ring versions of bootstrapping methods first proposed by Alperin-Sheriff and Peikert (AP) [3] and Gama, Izabachene, Nguyen, and Xie (GINX) [32].”
• A Survey on Homomorphic Encryption Schemes (2017, methodology): “…Tanping et al. 2015; Wang et al. 2015b], some optimizations focused on better (faster) bootstrapping algorithms [Alperin-Sheriff and Peikert 2013; Alperin-Sheriff and Peikert 2014], speeding homomorphic operations [Gentry et al. 2012], and a new extension to FHE for multi-identity and multi-key…”
• SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers (2015, methodology): “Bootstrapping was introduced to the GSW scheme in [12], [13], with the bootstrapping in [13] completing in under a second.”
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (2016, methodology): “The last corollaries describe exactly the internal products already presented in [16], [3], [13] and [11] with adapted notations.”
• Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping (2017, background): “Previous solutions proposed in [21, 1, 19] based on the internal product are not practical.”
• Bootstrapping for Approximate Homomorphic Encryption (2018, background): “Meanwhile, Ducas and Micciancio [24] proposed the FHEW scheme that bootstraps a single-bit encryption in less than a second based on the framework of [2].”