On Constructing a Fully Homomorphic Encryption
https://doi.org/10.15514/ISPRAS-2012-23-25
Abstract
Suggested a new construction for full homomorphic encryption which doesn’t use an extra information on secret key.
About the Authors
A. V. Shokurov
ISP RAS, Moscow
Russian Federation
Russian Federation
K. V. Sergeev
ISP RAS, Moscow
Russian Federation
Russian Federation
References
1. Craig Gentry, Computing arbitrary functions of encrypted data. ACM, 2010.
2. Craig Gentry, Fully homomorphic encryption using ideal lattices. 41st ACM STOC, 2009.
3. Craig Gentry, A fully homomorphic encryption scheme. Stanford University, Ph.D. thesis. 2009.
4. M. van Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan, Fully homomorphic encryption over the integers. International Association for Cryptographic Research, 2010.
5. Н. П. Варновский, А. В. Шокуров, Гомоморфное шифрование. Труды Института Системного Программирования. Том 12. М: ИСП РАН, 2007, с. 27-36.
Review
For citations:
Shokurov A.V., Sergeev K.V. On Constructing a Fully Homomorphic Encryption. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2012;23. (In Russ.) https://doi.org/10.15514/ISPRAS-2012-23-25
Email this article 