A Proposed Fully Homomorphic for Securing Cloud Banking Data at Rest
Keywords:Cloud Computing Security, Encryption, Decryption, Cloud Storage, Homomorphic Encryption
Fully homomorphic encryption (FHE) reaped the importance and amazement of most researchers and followers in data encryption issues, as programs are allowed to perform arithmetic operations on encrypted data without decrypting it and obtain results similar to the effects of arithmetic operations on unencrypted data. The first (FHE) model was introduced by Craig Gentry in 2009, and it was just theoretical research, but later significant progress was made on it, this research offers FHE system based on directly of factoring big prime numbers which consider open problem now, The proposed scheme offers a fully homomorphic system for data encryption and stores it in encrypted form on the cloud based on a new algorithm that has been tried on a local cloud and compared with two previous encryption systems (RSA and Paillier) and shows us that this algorithm reduces the time of encryption and decryption by 5 times compared to other systems.
 J. Domingo-Ferrer, O. Farràs, J. Ribes-González and D.Sánchez. “Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges”. Computer and Communications, vol. 140-141, no. 2018, pp. 38-60, 2019.
 S. Sakharkar, S. Karnuke, S. Doifode and V. Deshmukh. “A research homomorphic encryption scheme to secure data mining in cloud computing for banking system”. International Journal for Innovative Research in Multidisciplinary Field, vol. 4, no. 4, pp. 276-280, 2018.
 J. H. Cheon, A. Kim, M. Kim and Y. Song. “Homomorphic encryption for arithmetic of approximate numbers”. In: Lecture Notes in Computer Science. Vol. 10624. Springer Science+Business Media, Berlin, Germany, pp. 409-437, 2017.
 P. Sha and Z. Zhu. “The modification of RSA algorithm to adapt fully homomorphic encryption algorithm in cloud computing”. In: Proceeding 2016 4th IEEE International Conference Cloud Computing and Intelligence Systems. pp. 388-392, 2016.
 L. Chen and Z. Zhang. “Bootstrapping Fully Homomorphic Encryption with Ring Plaintexts Within Polynomial Noise. Vol. 2. Conference Paper, pp. 285-304, 2017.
 C. Gentry. “A Fully Homomorphic Encryption Scheme”. Dissertation, p. 169, 2009.
 V. Kumar and N. Srivastava. “Chinese Remainder Theorem based Fully Homomorphic Encryption over Integers”. International Journal of Applied Engineering Research, vol. 14, no. 2, pp. 203-208, 2019.
 M. A. Mohammed and F. S. Abed. “A symmetric-based framework for securing cloud data at rest”. Turkish Journal of Electrical Engineering and Computer Sciences, vol. 1, pp. 347-361, 2019.
 K. Gai, M. Qiu, Y. Li and X. Y. Liu. “Advanced fully homomorphic encryption scheme over real numbers”. In: Proceeding 4th IEEE International Conference Cyber Secur Cloud Computing CSCloud 2017 3rd IEEE Intertnational Conference Scalable Smart Cloud, SSC 2017, pp. 64-69, 2017.
 C. Gentry, S. Halevi and N. P. Smart. “Fully homomorphic encryption with polylog overhead”. In: Lecture Notes in Computer Science. Vol. 7237. Springer Science+Business Media, Berlin, Germany, pp. 465-482, 2012.
 J. Fan and F. Vercauteren. “Somewhat practical fully homomorphic encryption”. In: Proceeding 15th International Conference Practice Theory Public Key Cryptogr, pp. 1-16, 2012.
 Z. Brakerski and V. Vaikuntanathan. “Fully homomorphic encryption from ring-LWE and security for key dependent messages”. In: Lecture Notes in Computer Science. Vol. 6841. Springer, Berlin, Germany, pp. 505-524, 2011.
 X. Cao, C. Moore, M. O’Neill, N. Hanley and E. O’Sullivan. “Highspeed fully homomorphic encryption over the integers”. In: Lecture Notes in Computer Science. Vol. 8438. Springer, Berlin, Germany, pp. 169-180, 2014.
 C. Xiang and C. M. Tang. “Improved fully homomorphic encryption over the integers with shorter public keys”. International Journal of Security and its Applications, vol. 8, no. 6, pp. 365-374, 2014.
 M. M. Potey, C. A. Dhote and D. H. Sharma. “Homomorphic encryption for security of cloud data”. Procedia Computer Science, vol. 79, pp. 175-181, 2016.
 K. Gai and M. Qiu. “Blend arithmetic operations on tensorbased fully homomorphic encryption over real numbers”. IEEE Transactions on Industrial Informatics, vol. 14, no. 8, pp. 3590- 3598, 2018.
 S. S. Hamad and A. M. Sagheer. “Design of fully homomorphic encryption by prime modular operation”. Telfor Journal, vol. 10, no. 2, pp. 118-122, 2018.
 S. S. Hamad and A. M. Sagheer. “Fully homomorphic encryption based on Euler’s theorem”. The International Journal of Information Security, vol. 9, no. 3, p. 83, 2018.
 V. Kumar, R. Kumar, S. K. Pandey and M. Alam. “Fully homomorphic encryption scheme with probabilistic encryption based on euler’s theorem and application in cloud computing”. In: Advances in Intelligent Systems and Computing. Vol. 654. Springer, Berlin, Germany, pp. 605-611, 2018.
 R. F. Hassan and A. M. Sagheer. “A proposed secure cloud environment based on homomorphic encryption”. International Advanced Research Journal in Science, Engineering and Technology, vol. 6, no. 5, pp. 166-175, 2019.