An Efficient Solution Towards Secure Homomorphic Symmetric Encryption Algorithms

¹ Lebanese University, Faculty of Engineering-CRSI, Hadath, Lebanon
² Saint Joseph University, ESIB-CIMTI, Mar Roukoz, Lebanon
³ American University of Beirut, Department of Electrical and Computer Engineering, Hamra, Lebanon

^* e-mail: khalil.hariss@net.usj.edu.lb
^** e-mail: hn49@aub.edu.lb
^*** e-mail: Samhat@ul.edu.lb
^**** e-mail: maroun.chamoun@usj.edu.lb

Abstract

In this paper, we consider Homomorphic Encryption (HE) to process over encrypted data in order to achieve user privacy. We present a framework solution to provide a high level of security for the symmetric HE algorithms. The proposed solution introduces a dynamic structure and dynamic diffusion’s primitives that enhance existing symmetric HE algorithms and overcome their weaknesses. We apply this solution to a well known symmetric homomorphic approach, the PORE (Polynomial Operation for Randomization and Encryption) approach. The security analysis of the proposed solution shows that it ensures a high level of security without performance degradation. It is also evaluated against different attacks. This leads to secure and efficient HE Algorithms for practical implementations.