On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers

  • Zhenfei Zhang
  • Thomas Plantard
  • Willy Susilo
Conference paper

DOI: 10.1007/978-3-642-29101-2_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7232)
Cite this paper as:
Zhang Z., Plantard T., Susilo W. (2012) On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers. In: Ryan M.D., Smyth B., Wang G. (eds) Information Security Practice and Experience. ISPEC 2012. Lecture Notes in Computer Science, vol 7232. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

Fully Homomorphic Encryption Somewhat Homomorphic Encryption CCA-1 attack Approximate GCD 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Zhenfei Zhang
    • 1
  • Thomas Plantard
    • 1
  • Willy Susilo
    • 1
  1. 1.Centre for Computer and Information Security Research, School of Computer Science & Software Engineering (SCSSE)University Of WollongongAustralia

Personalised recommendations