Cryptology ePrint Archive: Report 2018/1070

A New Batch FHE Scheme over the Integers

Kwak Wi Song and Kim Chol Un

Abstract: The FHE (fully homomorphic encryption) schemes [7, 13] based on the modified AGCD problem (noise-free AGCD problem) are vulnerable to quantum attacks, because its security relies partly on the hardness of factoring, and some FHE schemes based on the decisional AGCD without the noise-free assumption, for example [1], has a drawback that its ciphertexts are very large. In this paper, we construct a new batch FHE scheme based on the decisional AGCD problem to overcome these weaknesses and prove its security.

Category / Keywords: public-key cryptography / FHE, AGCD problem, Batch Encryption, Chinese Remainder Theorem

Date: received 3 Nov 2018

Contact author: matadj79 at yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20181109:163045 (All versions of this report)

Short URL: ia.cr/2018/1070


[ Cryptology ePrint archive ]