Scale-Invariant Fully Homomorphic Encryption over the Integers

By Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi. 2014

199 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Privacy & Security

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. Martin Jaggi
2. Qiang Yang
3. Jakub Konecný
4. Peter Kairouz
5. Peter Richtárik
6. Ananda Theertha Suresh
7. Jianyu Wang
8. Sebastian U. Stich

In Computational Theory and Mathematics

1. Miran Kim
2. Yongsoo Song
3. Jung Hee Cheon
4. Andrey Kim
5. Nicolas Gama
6. Mariya Georgieva
7. Malika Izabachène
8. Ilaria Chillotti

In Privacy & Security

1. Peter Kairouz
2. Badih Ghazi
3. Rasmus Pagh
4. Qiang Yang
5. Ziteng Sun
6. Adrià Gascón
7. H. Brendan McMahan
8. Aurélien Bellet

Citations in the corpus

• Advances and Open Problems in Federated Learning (2019, background): “Different flavours of HE exist, ranging from general fully homomorphic encryption (FHE) [176] to the more efficient leveled variants [79, 160, 80, 112], for which several implementations exist [3, 350, 4].”
• A Survey on Homomorphic Encryption Schemes (2017, methodology): “Some further approaches for FHE schemes over integers are also proposed: a new scale invariant FHE over integers [Coron et al. 2014], a new scheme with integer plain-texts [Ramaiah and Kumari 2012a], a new SWHE scheme for computing arithmetic operations on large integer numbers without converting…”
• Homomorphic Encryption for Arithmetic of Approximate Numbers (2017, methodology): “The intuition of approximate encryption has been partially used previously, for example, a switching key for homomorphic multiplication in [4–6,12] or an evaluation key for the squashed decryption circuit in [13,18] are encrypted in a similar way.”
• TFHE: Fast Fully Homomorphic Encryption Over the Torus (2019, methodology): “But as in [10,18,26], our technique relies on a circular security assumption, even in the leveled mode since our key-switching key encrypts its own key bits.”
• Bootstrapping for Approximate Homomorphic Encryption (2018, background): “There have been a number of studies [22, 8, 9, 6, 7, 25, 30, 11, 5, 31, 19, 16] to improve the efficiency of HE cryptosystem after Gentry’s blueprint [26].”
• HEPCloud: An FPGA-Based Multicore Processor for FV Somewhat Homomorphic Function Evaluation (2018, background): “schemes to improve the performance of FHE [6], [7], [12], [16], [18], [19], [27], [37].”
• Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping (2017, methodology): “But as in [2, 10, 15], our technique relies on a”