Novel Homomorphic Encryption Scheme in Cloud Computing

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    Cloud computing is an indispensable technology for any business organization, such as banking, e-commerce, etc. Although technology has advantages in many areas; The protection of stored data is a major concern for all stakeholders in the architecture. Provide data security with respect to network security, control strategies and access to the service, data storage. Despite the efforts of service providers to build customer trust in data security, users need a passion for using technology for their business skills. Homomorphism coding is a data protection technique in which tasks can be performed on encrypted data themselves. In this article, we present an exploration of new homomorphism encryption methods with respect to data security and their use in cloud computing.

     

     


  • Keywords


    Cloud Data storage, Data Security, Fully Homomorphic Encryption, Homomorphism Encryption, HomomorphicKey.

  • References


      [1] P.Mell,T.Grance ,”The NIST Definition of Cloud Computing”,National Institute of Standards and Technology,U.S.Department of Commerce,September 2011.

      [2] R.Kanagavalli and Dr.Vagdevi S,”A Mixed Homomorphic Encryption Scheme for Secure Data Storage in Cloud”, IEEE Intemational Advanced Computing Conference IACC2015,2015,D.O.I:10.1109/IADCC.2015.7154867.

      [3] K.Lauter,M.Nachirg,V.Vaikuntanathan,”Can Homomorphic Encryption be Pratical?,”CCSW’11,October 21,2011,Chicago,Illinois,USA,pp.113-124.

      [4] M.TEBAA and S.ELHAJII,”Secure cloud computing through Homomorphic Encryption “,International Journal of Advancments in Computing Technology, Vol.5,No.16, 2013,pp.29-38.

      [5] Payal V.Parmar,et.al ,”Survey of Various Homomorphic Encryption algorithms and Schemes”,Interational Journal of Computer Applications(0975-8887), Vol.91,No.8, April 2014,pp.26-32.

      [6] M.Ogburn,C.Turner,P.Dahal,”Homomorphic Encryption In Complex Adaptive Systems”,Publication 3, Baltimore,MD,Elsevier,2013,pp.502-509.

      [7] R.Rivest,A.Shamir,and L.Adleman,”A method for obtaining digital signatures and public key cryptosystems”,Communication of the ACM,21(2):120-26,1978.ComputerScience,Springer,1999,pp.223- 238.

      [8] T.ElGamal,”A Public Key Cryptosystem and a signature scheme based on discrete logarithms”,IEEE Transactions on Information Theory,1985,pp.469-472

      [9] Pascal Paillier,”Public-key cryptosystems based on composite degree residuosity classes”,In 18th Annual Eurocrypt conference (EUROCRYPT99),Prague,Czech Republic,Vol.1592,1999.

      [10] Boneh,E.Goh,K.Nissim,”Evalauting 2-DNF formulas on ciphertexts”,In Theory of Cryptography Conference , TCC’05, Springer, 2005, pp.325-341.


 

View

Download

Article ID: 14499
 
DOI: 10.14419/ijet.v7i3.3.14499




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.