1157 SECURING DATA USING FULLY HOMOMORPHIC ENCRYPTION SCHEMES OVER CLOUD COMPUTING
Abstract
Full Text:
PDFReferences
M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, ―Fully homomorphic encryption over the integers, in EUROCRYPT, 2010, pp. 24–43.
N. Howgrave-Graham, ―Approximate integer common divisors, in CaLC, 2001, pp. 51–66.
Z. Brakerski, C. Gentry, and V. Vaikuntanathan, ―Fully homomorphic encryption without bootstrapping,Cryptology ePrint Archive, Report 2011/277, 2011.
Vadim Lyubashevsky, Chris Peikert, and Oded Regev, ―On ideal lattices and learning with errors over rings, in EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, pages 1–23, 2010.
Oded Regev, ―On lattices, learning with errors, random linear codes, and cryptography, in Harold N. Gabow and Ronald Fagin, editors, STOC, pages 84–93. ACM, 2005.
Gu Chunsheng, ―Attack on Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive, Report 2012/157, 2012.
National Institute of Standards and Technology - Computer Security Resource Center - www.csrc.nist.gov.
R. Rivest, L. Adleman, and M. Dertouzos, ―On data banks and privacy homomorphisms, in Foundations of Secure Computation. Academic Press, 1978, pp. 169–177.
T. E. Gamal, ―A public key cryptosystem and a signature scheme based on discrete logarithms, in CRYPTO, 1984, pp. 10–18.
Gu Chunsheng, ―Attack on Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive, Report 2012/157, 2012.
DOI: http://dx.doi.org/10.6084/ijact.v3i10.184
Refbacks
- There are currently no refbacks.