The notion of fully homomorphic encryption is very important since it enables many important applications, such as the cloud computing scenario. In EUROCRYPT 2010, van Dijk, Gentry, Halevi and Vaikuntanathan proposed an interesting fully homomorphic encryption scheme based on a somewhat homomorphic encryption scheme using integers. In this paper, we demonstrate a very practical CCA-1 attack against this somewhat homomorphic encryption scheme. Given a decryption oracle, we show that within O(λ 2) queries, we can recover the secret key successfully, where λ is the security parameter for the system. © 2012 Springer-Verlag.
CITATION STYLE
Zhang, Z., Plantard, T., & Susilo, W. (2012). On the CCA-1 security of somewhat homomorphic encryption over the integers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7232 LNCS, pp. 353–368). https://doi.org/10.1007/978-3-642-29101-2_24
Mendeley helps you to discover research relevant for your work.