Big Data Analytics and Data Security in the Cloud via Fully Homomorphic Encryption

Abstract—This paper describes the problem of building secure computational services for encrypted information in the Cloud Computing without decrypting the encrypted data; therefore, it meets the yearning of computational encryption algorithmic aspiration model that could enhance the security of big data for privacy, confidentiality, availability of the users. The cryptographic model applied for the computational process of the encrypted data is the Fully Homomorphic Encryption Scheme. We contribute a theoretical presentations in a high-level computational processes that are based on number theory and algebra that can easily be integrated and leveraged in the Cloud computing with detail theoretic mathematical concepts to the fully homomorphic encryption models. This contribution enhances the full implementation of big data analytics based cryptographic security algorithm.

[1]  Ivan Damgård,et al.  A generalization of Paillier’s public-key system with applications to electronic voting , 2010, International Journal of Information Security.

[2]  Craig Gentry,et al.  Computing arbitrary functions of encrypted data , 2010, CACM.

[3]  S. Halevi,et al.  Implementing Gentry ’ s Fully-Homomorphic Encryption Scheme Preliminary Report , 2010 .

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Michael J. Fischer,et al.  A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Vinod Vaikuntanathan,et al.  (Leveled) Fully Homomorphic Signatures from Lattices , 2014, IACR Cryptol. ePrint Arch..

[7]  Vinod Vaikuntanathan,et al.  Computing Blindfolded: New Developments in Fully Homomorphic Encryption , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

[9]  Nitin Jain,et al.  Implementation and Analysis of Homomorphic Encryption Schemes , 2012 .

[10]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[11]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[12]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[13]  P. Mell,et al.  The NIST Definition of Cloud Computing , 2011 .

[14]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[15]  Craig Gentry,et al.  Fully Homomorphic Encryption without Bootstrapping , 2011, IACR Cryptol. ePrint Arch..

[16]  Arkady Yerukhimovich,et al.  A survey of cryptographic approaches to securing big-data analytics in the cloud , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).