Faster Fully Homomorphic Encryption

By Damien Stehlé, Ron Steinfeld. International Conference on the Theory and Application of Cryptology and Information Security, 2010

342 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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

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

In Information Systems

Citations in the corpus

Fully Homomorphic Encryption with Polylog Overhead (2012, background): “For comparison, the smallest overhead for FHE was Õ(λ) [10] until BGV recently reduced it to Õ(λ) [5].”
Somewhat Practical Fully Homomorphic Encryption (2012, background): “The first variants [21, 18, 20, 4, 5] of Gentry’s scheme all followed the same structure and as such had to make additional security assumptions to enable the squashing step.”
A Survey on Homomorphic Encryption Schemes (2017, methodology): “curity of the hardness assumption of SSSP by presenting a quantum worst case/average case reduction. However, a more aggressive analysis of the security of SSSP was completed by Stehle and Steinfeld [Stehlé and Steinfeld 2010]. They also suggested a new probabilistic decryption algorithm with lower ”
Efficient Fully Homomorphic Encryption from (Standard) LWE (2011, methodology): “The first generation of fully homomorphic encryption includes Gentry’s scheme (and a variant thereof by Smart and Vercauteren [SV10] and an optimization by Stehlé and Steinfeld [SS10]), as well as two followup works that followed similar principles [DGHV10, BV11a].”
(Leveled) fully homomorphic encryption without bootstrapping (2012, neutral): “The analysis above ignores a nice optimization by Stehlé and Steinfeld [22], which so far has not been useful in practice, that uses Chernoff bounds to asymptotically reduce the decryption degree down to O( √ λ).”
Reusable garbled circuits and succinct functional encryption (2013, background): “The big leap of the last decade towards computing over encrypted data has been fully homomorphic encryption (FHE) [11–14, 17, 20–22, 38, 51, 52].”
Implementing Gentry's Fully-Homomorphic Encryption Scheme (2011, background): “Throughout the text we put more emphasis on concrete parameters than on asymptotics, asymptotic bounds can be found in [18].”
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (2012, background): “To prevent lattice attacks against the sparse subsetsum problem, one must have Θ(2) = γ · ω(log λ); see [7, 16] for more details.”
Attribute-based encryption for circuits (2013, methodology): “Our methodology departs significantly from the current line of work on attributebased encryption [27, 29] and instead, builds upon the connection to garbled circuits developed in the context of bounded collusions [26, 44].”
Fully Homomorphic Encryption over the Integers with Shorter Public Keys (2011, methodology): “We use the refined analysis from [17] of the sparse subset sum problem.”
(Leveled) Fully Homomorphic Encryption without Bootstrapping (2014, neutral): “This analysis ignores a nice optimization by Stehlé and Steinfeld [2010] that uses Chernoff bounds to asymptotically reduce the decryption degree down to O( √ λ).”