SECURING DATA USING FULLY HOMOMORPHIC ENCRYPTION SCHEMES OVER CLOUD COMPUTING

Authors

  • Kumar VS Student, Computer Science and Engineering Dept., Dr. KVSR Institute of Technology, Andhra Pradesh, INDIA
  • Kumar VT Assoc. Professor, Information Technology Dept., Dr. KVSR Institute of Technology, Andhra Pradesh, INDIA

Keywords:

Fully Homomorphic Encryption, homomorphic scheme, Security, Partial Homomorphic Encryption

Abstract

There is a problem for business organizations to move towards cloud computing regarding the safety and security issues associated with cloud computing. Different technologies have been used to relate these types of issues including various control methods and cryptographic techniques. When the data transmitted to the Cloud we use standard encryption methods to secure the operations and the storage of the data. Fully homomorphic encryption has cloud computing is to perform computations on encrypted data without previous decryption. The first fully homomorphic schemes have been proposed and developed to improve the performance, reduce the complexity and the cost of the scheme. Mainly two important schemes are refreshed and discussed in this paper. The first scheme discoursed in this paper is “Encryption over Integers using fully Homomorphism”. The second one is about “Encryption without Bootstrapping by using fully Homomorphism”. These two are basically concentrated on the security, performance and complexity factors of the mentioned schemes.

References

M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan,―Fully homomorphic encryption over the integers, in EUROCRYPT, 2010, pp. 24–43.

N. Howgrave-Graham, ―Approximate integer common divisors, in CaLC, 2001, pp. 51–66.

Z. Brakerski, C. Gentry, and V. Vaikuntanathan, ―Fully homomorphic encryption without bootstrapping, Cryptology ePrint Archive, Report 2011/277, 2011.

Vadim Lyubashevsky, Chris Peikert, and Oded Regev, ―On ideal lattices and learning with errors over rings, in EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, pages 1–23, 2010.

Oded Regev, ―On lattices, learning with errors, random linear codes, and cryptography, in Harold N. Gabow and Ronald Fagin, editors, STOC, pages 84–93. ACM, 2005.

Gu Chunsheng, ―Attack on Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive, Report 2012/157, 2012.

National Institute of Standards and Technology - Computer Security Resource Center - www.csrc.nist.gov.

R. Rivest, L. Adleman, and M. Dertouzos, ―On data banks and privacy homomorphisms, in Foundations of Secure Computation. Academic Press, 1978, pp. 169–177.

T. E. Gamal, ―A public key cryptosystem and a signature scheme based on discrete logarithms, in CRYPTO, 1984, pp. 10–18.

Gu Chunsheng, ―Attack on Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive, Report 2012/157, 2012.

Downloads

Published

2024-02-26

How to Cite

Kumar, V. S., & Kumar, V. (2024). SECURING DATA USING FULLY HOMOMORPHIC ENCRYPTION SCHEMES OVER CLOUD COMPUTING. COMPUSOFT: An International Journal of Advanced Computer Technology, 3(10), 1157–1160. Retrieved from https://ijact.in/index.php/j/article/view/204

Issue

Vol. 3 No. 10 (2014): October

Section

Original Research Article

License

Copyright (c) 2014 COMPUSOFT: An International Journal of Advanced Computer Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.