An Improved Fully Homomorphic Encryption Scheme for Cloud Computing. | [International Journal of Communication Networks and Information Security • 2018]

Author(s):

1. Mohd Rizuan Baharon: Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia

2. Qi Shi: Department of Computer Science, Liverpool John Moores University, Liverpool L3 3AF, United Kingdom

3. Mohd Faizal Abdollah: Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia

4. S M Warusia Mohamed S M M Yassin: Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia

5. Ariff Idris: Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia

Abstract:

Business in cloud computing is very popular among Small and Medium Enterprises (SMEs). By leveraging services from the cloud, such companies can migrate all of their in-house operations to cloud at low costs with minimum IT facility requirements such as desktop machines and the Internet. Even though the cloud promises tremendous advantages in terms of computing resources and storage spaces, some of the companies are still reluctant to adopt such a technology because of security concerns. To overcome such problems, a fully homomorphic encryption (FHE) scheme with improved efficiency can be implemented as the scheme allows computation on encrypted data without decryption. In this paper, we propose an improved FHE scheme that uses a symmetric key for encryption together with a protocol to implement the scheme. Furthermore, we also provide an analysis regarding to the noise growth in the processed ciphertext and squashing technique that is required to reduce the noise. This analysis is essential to improve the efficiency of the scheme as the squashing technique is time-consuming.

Page(s): 502-508

DOI: DOI not available

Published: Journal: International Journal of Communication Networks and Information Security, Volume: 10, Issue: 3, Year: 2018

Keywords:

Cloud Computing , Integers , Symmetric Encryption Scheme , Asymmetric Encryption Scheme , Fully Homomorphic Encryption Scheme

References:

[1] S.Marston, 2011., 1 -11

[2] G. V.Mini,K. S. A.Viji, 2017.A Comprehensive Cloud Security Model with Enhanced Key Management , Access Control and Data Anonymization Features,International Journal of Communication Networks and Information Security 9 263 -273

[3] D.Zissis,D.Lekkas, 2012.Addressing cloud computing security issues,” Future Generation Computer Systems, 28 583 -592

[4] M. R.Baharon,Q.Shi,D.Llewellyn-Jones,M.Merabti, 2013.Efficient and secure remote data storing and processing,” European Conference on Information Warfare and Security 396 -401

[5] C.Gentry,S.Halevi, 2011.Implementing Gentry ' s FullyHomomorphic Encryption Scheme,” 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques 1 -29

[6] D.Stehlé,R.Steinfeld, 2010.Faster fully homomorphic encryption,” in International Conference on the Theory and Application of Cryptology and Information Security 377 -394

[7] A.Mandal,D.Naccache,M.Tibouchi, 2011.Fully Homomorphic Encryption over the Integers with Shorter Public Keys,”,Proceedings of the 31st annual conference on Advances in Cryptology 487 -504

[8] M.Tibouchi, 2013.,Batch Fully Homomorphic Encryption over the Integers,” Lecture Notes in Computer Science 7881 315 -355

[9] J.Kim,M. S.Lee,A.Yun,J. H.Cheon, 2013.CRT-based Fully Homomorphic Encryption over the Integers,”,IACR Cryptology ePrint Archive 1 -18

[10] Z.Brakerski,C.Gentry,V.Vaikuntanathan, 2012.(Leveled) fully homomorphic encryption without bootstrapping,” Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12 309 -325

[11] J.Fan,F.Vercauteren, 2012.,” Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography 1 -16

[12] G.Davis, 1987.Communications of the ACM, 30 777 -780

[13] C.Gentry, 2010.Computing arbitrary functions of encrypted data,” Communications of the ACM, 53 97 -105

[14] D.Boneh,TCC, 2005., 325 -341

[15] M.Naehrig,K.Lauter,V.Vaikuntanathan, 2011.,” Proceedings of the 3rd ACM workshop on Cloud computing security workshop - CCSW '11 113 -124

[16] C.Gentry,A FullyHomomorphic Encryption Scheme,Ph . D.,Dissertation, 2009., -

[17] N. P.Smart,F.Vercauteren, 2010.Fully Homomorphic Encryption with Relatively Small Key,” Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography 420 -443

[18] M.Tibouchi, 2014.Scale-Invariant Fully Homomorphic Encryption over the Integers,” Lecture Notes in Computer Science 8383 311 -328

[19] Z.Brakerski, 2012.Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP,”,Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology 7417 868 -886

[20] C.Gentry,S.Halevi, 2011.Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits,” IEEE 52nd Annual Symposium on Foundations of Computer Science 107 -109

[21] Y.Doröz,B.Sunar, 2014.A million-bit multiplier architecture for fully homomorphic encryption,” Microprocessors and Microsystems, 38 766 -775

[22] B.Pourghebleh,N. J.Navimipour, 2017.Data aggregation mechanisms in the Internet of things : A systematic review of the literature and recommendations for future research,April 97 23 -34

[23] P.Karu, 2001.Practical Comparison of Fast Public-key Cryptosystems,” Telecommunications Software and Multimedia Lab, 1 -18

[24] M. Van Dijk , C.,Gentry , S.,Halevi , and V.,Vaikuntanathan, 2010.Fully Homomorphic Encryption over the Integers,”,Annual International Conference on the Theory and Applications of Cryptographic Techniques 24 -43

[25] M. R.Baharon,Q.Shi,D., 2015.A New Lightweight Homomorphic Encryption Scheme for Mobile Cloud Computing,”,IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing 618 -625

[26] J. H.Cheon,H.Hong,M. S.Lee,H.Ryu, 2016.The Polynomial Approximate Common Divisor Problem and its Application to the Fully Homomorphic Encryption,”,Information Sciences 326 41 -58

[27] Z.Chen, 2017., 1 -77

Citations

Citations are not available for this document.

Citations

Downloads

Views