Fully Enhanced Homomorphic Encryption algorithm of MORE approach for real world applications

Abstract The design of a Homomorphic Encryption (HE) algorithm that allows computation over the encrypted data is required in real world modern applications to preserve the privacy. Such applications include Cloud Computing, shared storage, processing resources, etc. The existing solutions are not practical for real world applications. Asymmetric approaches suffer from high computation overhead, while symmetric approaches suffer from low immunity against attacks such as chosen and known plaintext attack. In this paper, we consider symmetric approaches and we focus on Matrix Operation for Randomization and Encryption (MORE) approach to build a new algorithm overcoming the drawbacks of MORE. The proposed algorithm is explained in details and evaluated. The security performance results show that the proposed approach can prevent the strong attacks without degradation of the system performances in term of latency and energy consumption.

[1]  Guy Gogniat,et al.  Recent Advances in Homomorphic Encryption , 2013 .

[2]  Caroline Fontaine,et al.  A Survey of Homomorphic Encryption for Nonspecialists , 2007, EURASIP J. Inf. Secur..

[3]  J Domingo Ferrer A PROVABLY SECURE ADDITIVE AND MULTIPLICATIVE PRIVACY HOMOMORPHISM , 2002 .

[4]  Hassan N. Noura,et al.  HLDCA-WSN: Homomorphic Lightweight Data Confidentiality Algorithm for Wireless Sensor Network , 2015, IACR Cryptol. ePrint Arch..

[5]  S. Vaudenay,et al.  Cryptanalysis of Chosen Symmetric Homomorphic Schemes , 2015, CRYPTO 2014.

[6]  Aldar C.-F. Chan,et al.  Symmetric-Key Homomorphic Encryption for Encrypted Data Processing , 2009, 2009 IEEE International Conference on Communications.

[7]  Xuemin Shen,et al.  P-Coding: Secure Network Coding against Eavesdropping Attacks , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Aviad Kipnis,et al.  Efficient Methods for Practical Fully Homomorphic Symmetric-key Encrypton, Randomization and Verification , 2012, IACR Cryptol. ePrint Arch..

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

[10]  D. Haridas,et al.  Strengthened Iterated Hill Cipher for encrypted processing , 2012, 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing.

[11]  Craig Gentry,et al.  A fully homomorphic encryption scheme , 2009 .

[12]  Iti Sharma,et al.  Fully Homomorphic Encryption Scheme with Symmetric Keys , 2013, ArXiv.

[13]  Guy Gogniat,et al.  Towards Practical Program Execution over Fully Homomorphic Encryption Schemes , 2013, 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[14]  Josep Domingo A new privacy homomorphism and applications , 1996 .

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

[16]  I-Ling Yen,et al.  An Efficient Homomorphic Encryption Protocol for Multi-User Systems , 2012, IACR Cryptol. ePrint Arch..

[17]  Abdelkarim Erradi,et al.  Paillier's encryption: Implementation and cloud applications , 2015, 2015 International Conference on Applied Research in Computer Science and Engineering (ICAR).