A Secure Homomorphic Encryption Algorithm over Integers for Data Privacy Protection in Clouds

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10135)

Abstract

If a secure and efficient fully homomorphic encryption algorithm exists, it should be the ultimate solution for securing data privacy in clouds, where cloud servers can apply any operation directly over the homomorphically encrypted ciphertexts without having to decrypt them. With such encryption algorithms, clients’ data privacy can be preserved since cloud service providers can operate on these encrypted data without knowing the content of these data. Currently only one fully homomorphic encryption algorithm proposed by Gentry in 2009 and some of its variants are available in literature. However, because of the prohibitively expensive computing cost, these Gentry-like algorithms are not practical to be used to securing data in clouds. Due to the difficulty in developing practical fully homomorphic algorithms, partially homomorphic algorithms have also been studied in literature, especially for those algorithms homomorphic on arithmetic operations over integers. This paper presents a secure variant algorithm to an existing homomorphic algorithm over integers. The original algorithm allows unlimited number of arithmetic additions and multiplications but suffers on a security weakness. The variant algorithm patches the weakness by adding a random padding before encryption. This paper first describes the original algorithm briefly and then points out it’s security problem before we present the variant algorithm. An efficiency analysis for both the original and the variant algorithms will be presented at the end of the paper.

Keywords

Homomorphic encryption Non-deterministic encryption Cipher equality test Big data privacy Data privacy in clouds 

References

  1. 1.
    Top ten big data security and privacy challenges (2012). https://downloads.cloudsecurityalliance.org/initiatives/bdwg/Big_Data_Top_Ten_v1.pdf
  2. 2.
  3. 3.
    Cunsolo, V.D., Distefano, S., Puliafito, A., Scarpa, M.L.: Achieving information security in network computing systems. In: The 8th IEEE International Conference on Dependable, Autonomic and Secure Computing (2009)Google Scholar
  4. 4.
    Linthicum, D.: Afraid of outside cloud attacks? You’re missing the real threat (2010). http://www.infoworld.com/d/cloud-computing/afraid-outside-cloud-attacks-youre-missing-real-threat-894
  5. 5.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: The 41st ACM Symposium on Theory of Computing (STOC) (2009)Google Scholar
  6. 6.
    van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. International Association for Cryptologic Research (2009). http://eprint.iacr.org/2009/616
  7. 7.
    Smart, N., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. http://www.info.unicaen.fr/M2-AMI/articles-2009-2010/smart.pdf
  8. 8.
    Gentry, C., Halevi, S.: Implementing gentry’s fully homomorphic encryption scheme. In: EUROCRYPT 2011, pp. 129–148 (2011)Google Scholar
  9. 9.
    Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM Workshop on Cloud Computing Security, pp. 113–124 (2011)Google Scholar
  10. 10.
    Yeh, J.H.: A probabilistic homomorphic encryption algorithm over integers - protecting data privacy in clouds. In: 12th International Confenerce on Advanced and Trusted Computing (2015)Google Scholar
  11. 11.
    Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16 CrossRefGoogle Scholar
  14. 14.
    Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Heidelberg (1998). doi:10.1007/BFb0054135 CrossRefGoogle Scholar
  15. 15.
    Hayes, B.: Alice and Bob in cipherspace. Am. Sci. - Mag. Sigma Xi 100, 362–367 (2012). Computing ScienceGoogle Scholar
  16. 16.
    Pomerance, C.: On the distribution of pseudoprimes. Math. Comput. 37(156), 587–593 (1981)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceBoise State UniversityBoiseUSA

Personalised recommendations