Abstract
Cloud Computing is a kind of internet-based computing that provides shared storage and processing resources. One main drawback of this technique is that users and companies will give the permission to a third party to access their sensitive data. Homomorphic Encryption scheme came as a new cryptographic research topic to resolve the concerned problem by preserving the privacy in the cloud settings. In this paper, we propose a new efficient symmetric lightweight Fully Homomorphic Encryption algorithm, called “NOHE”, which profits from the simplicity of the logic NOT and the homomorphic behavior of Morgan Theorem. The proposed algorithm is explained in detail and evaluated. The security performance results show an acceptable execution time with no storage overhead and high immunity to attack.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aguilar-Melchor, C., Fau, S., Fontaine, C., Gogniat, G., Sirdey, R.: Recent advances in homomorphic encryption: a possible future. IEEE Signal Process. Mag. 30(2), 108–117 (2013)
Chan, AC-F.: Symmetric-key homomorphic encryption for encrypted data processing. In: 2009 IEEE International Conference on Communications, pp. 1–5. IEEE (2009)
Fau, S., Sirdey, R., Fontaine, C., Aguilar-Melchor, C., Gogniat, G.: Towards practical program execution over fully homomorphic encryption schemes. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp. 284–290. IEEE (2013)
Fontaine, C., Galand, F.: A survey of homomorphic encryption for nonspecialists. EURASIP J. Inf. Secur. 2007(1), 1–10 (2007)
Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Nassar, M., Erradi, A., Malluhi, Q.M.: Paillier’s encryption: implementation and cloud applications. In: 2015 International Conference on Applied Research in Computer Science and Engineering (ICAR), Beirut, pp. 1–5 (2015)
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_2
Xiao, L., et al.: An Efficient Homomorphic Encryption Protocol for Multi-User Systems. IACR Cryptology ePrint Archive, Report 2012/193
Kipnis, A., Hibshoosh, E.: Efficient methods for practical fully-homomorphic symmetric-key encryption, randomization, and verification. IACR Cryptology ePrint Archive, Report 2012/637
Ferrer, J.D.: A new privacy homomorphism and applications. Inf. Process. Lett. 60(5), 277–282 (1996)
Ferrer, J.D.: A provably secure additive and multiplicative privacy homomorphism. In: Chan, A.H., Gligor, V. (eds.) ISC 2002. LNCS, vol. 2433, pp. 471–483. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45811-5_37
Noura, H., Courrousé, D.: HLDCA-WSN:homomorphic lightweight data confidentiality algorithm for wireless sensor network. Int. Assoc. Cryptogr. Res. IACR 2015, 928 (2015)
Zhang, P., Jiang, Y., Lin, C., Fan, Y., Shen, X.: P-coding: secure network coding against eavesdropping attacks. In: 2010 Proceedings IEEE INFOCOM, pp. 1–9. IEEE (2010)
Noura, H., Samhat, A.E., Harkous, Y., Yahiya, T.A.: Design and realization of a neural block cipher. In: 2015 International conference on Applied Research in Computer Science and Engineering (IACR), Beirut, pp. 1–6 (2015). https://doi.org/10.1109/ARCSE 2015.7338131
Vizer, D., Vaudenay, S.: Cryptanalysis of chosen symmetric homomorphic scheme. Stud. Sci. Math. Hung. 52(2), 288–306 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Hariss, K., Noura, H., Samhat, A.E., Chamoun, M. (2018). Design and Realization of a Fully Homomorphic Encryption Algorithm for Cloud Applications. In: Cuppens, N., Cuppens, F., Lanet, JL., Legay, A., Garcia-Alfaro, J. (eds) Risks and Security of Internet and Systems. CRiSIS 2017. Lecture Notes in Computer Science(), vol 10694. Springer, Cham. https://doi.org/10.1007/978-3-319-76687-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-76687-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76686-7
Online ISBN: 978-3-319-76687-4
eBook Packages: Computer ScienceComputer Science (R0)