Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- FHEAGCD problemBatch EncryptionChinese Remainder Theorem
- Contact author(s)
- matadj79 @ yahoo com
- History
- 2018-11-09: received
- Short URL
- https://ia.cr/2018/1070
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/1070,
author = {Kwak Wi Song and Kim Chol Un},
title = {A New Batch FHE Scheme over the Integers},
howpublished = {Cryptology ePrint Archive, Paper 2018/1070},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/1070}},
url = {https://eprint.iacr.org/2018/1070}
}
