Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Implementing Gentry's fully-homomorphic encryption scheme
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Fully homomorphic encryption over the integers with shorter public keys
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Fully homomorphic encryption with relatively small key and ciphertext sizes
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
BKZ 2.0: better lattice security estimates
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
Following Gentry's breakthrough work [7], there is currently great interest on fully-homomorphic encryption (FHE), which allows to compute arbitrary functions on encrypted data. Though the area has seen much progress recently (such as [10,11,5,2,1,8,6]), it is still unknown if fully-homomorphic encryption will ever become truly practical one day, or if it will remain a theoretical curiosity. In order to find out, several FHE numerical challenges have been proposed by Gentry and Halevi [9], and by Coron et al. [5], which provide concrete parameters whose efficiency and security can be studied. We report on recent attempts [3,4] at breaking FHE challenges, and we discuss the difficulties of assessing precisely the security level of FHE challenges, based on the state-of-the-art. It turns out that security estimates were either missing or too optimistic.