The week's pick
Reseach Article
A Secured Homomorphic Encryption Technique in Cloud Computing
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 176 - Number 1 |
| Year of Publication: 2017 |
| Authors: Nitin Kamble, Pragati Hiwarkar, Monali Bachhav |
10.5120/ijca2017915501
|
Nitin Kamble, Pragati Hiwarkar, Monali Bachhav . A Secured Homomorphic Encryption Technique in Cloud Computing. International Journal of Computer Applications. 176, 1 ( Oct 2017), 5-9. DOI=10.5120/ijca2017915501
Abstract
Cloud computing security challenges to many researchers. Priority was to focus on security which is the biggest concern of organizations moving to the cloud. Cloud computing help in costs optimization, easy maintenance and re-provisioning of resources, and so the increased profits. The adoption of Cloud Computing applies only if the security is ensured. How to guaranty a better data security and also how can we keep the client private information confidential? There are two major queries that present a challenge to Cloud computing providers. When the data transferred to the Cloud we use standard encryption methods to secure the operations and the storage of the data. For processing data located on a remote server, the Cloud providers need to access the raw data. In this paper we are proposing a method to execute operations on encrypted data without decrypting them. It will yield the same results after calculations as if we have worked directly on the raw data.
References
- National Institute of Standards and Technology - Computer Security Division http://csrc.nist.gov/groups/ SNS/cloud-computing/
- Cloud Security Alliance, Security Guidance for Critical Areas of Focus in Cloud Computing V2.1 http://www.cloudsecurityalliance.org/csaguide.pdf.
- Cloud Security Alliance, Top Threats to Cloud Computing V1.0 http://www.cloudsecurityalliance.org/ topthreats/csathreats.v1.0.pdf.
- Maha TEBAA, Said EL HAJJI, Abdellatif EL GHAZI, “Homomorphic Encryption Applied to the Cloud Computing Security,” Proceedings of the World Congress on Engineering 2012 London, U.K., Vol. 1, 2012.
- Darko Hrestak and Stjepan Picek, “Homomorphic Encryption in the Cloud,” MIPRO 2014, Opatija, Croatia, pp. 1400-1404, May 2014.
- R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, pp. 120–126, 1978.
- R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of Secure Computation, Academia Press, pp. 169–179, 1978.
- S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270–299, 1984.
- T. El Gamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” in Proceedings of CRYPTO 84 on Advances in Cryptology. New York, NY, USA: Springer-Verlag New York, Inc., pp. 10–18, 1985.
- P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques, ser. EUROCRYPT’ 99. Berlin, Heidelberg: Springer-Verlag, 1999, pp. 223–238.
- I. Damgard and M. Jurik, “A generalisation, a simplification and some applications of paillier´s probabilistic public-key system,” in In proceedings of PKC ’01, LNCS series. Springer-Verlag, pp. 119–136, 2001.
- D. Boneh, E.-J. Goh, and K. Nissim, “Evaluating 2-dnf formulas on ciphertexts,” in Proceedings of the Second International Conference on Theory of Cryptography, ser. TCC’05. Berlin, Heidelberg: Springer- Verlag, pp. 325–341, 2005.
- C. Gentry, “A fully homomorphic encryption scheme,” Ph.D. dissertation, Stanford, CA, USA, 2009.
- V. Vaikuntanathan, “Computing blindfolded: New developments in fully homomorphic encryption,” in FOCS, pp. 5–16, 2011.
Index Terms
Keywords