Sciweavers

Share
ASIACRYPT
2010
Springer

Faster Fully Homomorphic Encryption

10 years 25 days ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improvements lead to a faster fully homomorphic scheme, with a O(3.5 ) bit complexity per elementary binary add/mult gate, where is the security parameter. These improvements also apply to the fully homomorphic schemes of Smart and Vercauteren [PKC'2010] and van Dijk et al. [Eurocrypt'2010].
Damien Stehlé, Ron Steinfeld
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where ASIACRYPT
Authors Damien Stehlé, Ron Steinfeld
Comments (0)
books