Paper 2020/121

When HEAAN Meets FV: a New Somewhat Homomorphic Encryption with Reduced Memory Overhead

Hao Chen, Ilia Iliashenko, and Kim Laine

Abstract

We demonstrate how to reduce the memory overhead of somewhat homomorphic encryption (SHE) while computing on numerical data. We design a hybrid SHE scheme that exploits the packing algorithm of the HEAAN scheme and the variant of the FV scheme by Bootland et al. The ciphertext size of the resulting scheme is 3-18 times smaller than in HEAAN to compute polynomial functions of depth 4 while packing a small number of data values. Furthermore, our scheme has smaller ciphertexts even with larger packing capacities (256-2048 values).

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.IMA CC 2021
Keywords
homomorphic encryptiondata encoding
Contact author(s)
ilia @ esat kuleuven be
History
2021-09-22: last of 3 revisions
2020-02-06: received
See all versions
Short URL
https://ia.cr/2020/121
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/121,
      author = {Hao Chen and Ilia Iliashenko and Kim Laine},
      title = {When HEAAN Meets FV: a New Somewhat Homomorphic Encryption with Reduced Memory Overhead},
      howpublished = {Cryptology ePrint Archive, Paper 2020/121},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/121}},
      url = {https://eprint.iacr.org/2020/121}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.