Publications
Detailed Information
Fully homomophic encryption over the integers revisited
Cited 75 time in
Web of Science
Cited 88 time in Scopus
- Authors
- Issue Date
- 2015-04
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science, Vol.9056, pp.513-536
- Abstract
- Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regevs Learning With Errors problem (LWE) and Howgrave-Grahams Approximate Greatest Common Divisor problem (AGCD). Our first contribution is a reduction from LWE to AGCD. As a second contribution, we describe a new AGCD-based fully homomorphic encryption scheme, which outperforms all prior AGCD-based proposals: its security does not rely on the presumed hardness of the so-called Sparse Subset Sum problem, and the bit-length of a ciphertext is only Õ(λ), where λ refers to the security parameter. © International Association for Cryptologic Research 2015.
- ISSN
- 0302-9743
- Files in This Item:
- There are no files associated with this item.
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.