Design of a Polynomial Ring based Symmetric Homomorphic Encryption Scheme

Publication date: Available online 12 July 2016 Source:Perspectives in Science Author(s): Smaranika Dasgupta, S.K. Pal Security of data, especially in clouds, has become immensely essential for present-day applications. Fully homomorphic encryption (FHE) is a great way to secure data which is used and manipulated by untrusted applications or systems. In this paper, we propose a symmetric FHE scheme based on polynomial over ring of integers. This scheme is somewhat homomorphic due to accumulation of noise after few operations, which is made fully homomorphic using a refresh procedure. After certain amount of homomorphic computations, large ciphertexts are refreshed for proper decryption. The hardness of the scheme is based on the difficulty of factorizing large integers. Also, it requires polynomial addition which is computationally cost effective. Experimental results are shown to support our claim.

Source: Perspectives in Science - July 14, 2016 Category: Science Source Type: research