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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Top ten big data security and privacy challenges (2012). https://downloads.cloudsecurityalliance.org/initiatives/bdwg/Big_Data_Top_Ten_v1.pdf
The notorious nine - cloud computing top threats in 2013. https://downloads.cloudsecurityalliance.org/initiatives/top_threats/The_Notorious_Nine_Cloud_Computing_Top_Threats_in_2013.pdf
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)
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
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: The 41st ACM Symposium on Theory of Computing (STOC) (2009)
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
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
Gentry, C., Halevi, S.: Implementing gentry’s fully homomorphic encryption scheme. In: EUROCRYPT 2011, pp. 129–148 (2011)
Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM Workshop on Cloud Computing Security, pp. 113–124 (2011)
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)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)
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
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
Hayes, B.: Alice and Bob in cipherspace. Am. Sci. - Mag. Sigma Xi 100, 362–367 (2012). Computing Science
Pomerance, C.: On the distribution of pseudoprimes. Math. Comput. 37(156), 587–593 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Yeh, JH. (2017). A Secure Homomorphic Encryption Algorithm over Integers for Data Privacy Protection in Clouds. In: Qiu, M. (eds) Smart Computing and Communication. SmartCom 2016. Lecture Notes in Computer Science(), vol 10135. Springer, Cham. https://doi.org/10.1007/978-3-319-52015-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-52015-5_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52014-8
Online ISBN: 978-3-319-52015-5
eBook Packages: Computer ScienceComputer Science (R0)