Design of a polynomial ring based symmetric homomorphic encryption scheme

详细信息    查看全文

• 作者：Smaranika Dasgupta ; ^{smaranikadasgupta@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; S.K. Pal ^{skptech@yahoo.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Fully homomorphic encryption ; Cloud computing ; Symmetric FHE ; Polynomial rings ; Refresh
• 刊名：Perspectives in Science
• 出版年：2016
• 出版时间：September 2016
• 年：2016
• 卷：8
• 期：Complete
• 页码：692-695
• 全文大小：355 K

文摘

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.