Design of a polynomial ring based symmetric homomorphic encryption scheme

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 polynomi...

Full description

Saved in:
Bibliographic Details
Published in:Perspectives in science 2016-09, Vol.8, p.692-695
Main Authors: Dasgupta, Smaranika, Pal, S.K.
Format: Article
Language:English
Subjects:
Cloud computing
Fully homomorphic encryption
Polynomial rings
Refresh
Symmetric FHE
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2213-0209
2213-0209
DOI:10.1016/j.pisc.2016.06.061