Multi-bit homomorphic encryption based on  learning with errors over rings

Zhang Wei; Liu Shuguang; Yang Xiaoyuan

Paper 2013/138 Original: eprint.iacr.org/2013/138 ↗

Multi-bit homomorphic encryption based on learning with errors over rings

Zhang Wei

Liu Shuguang

Yang Xiaoyuan

Abstract

Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication can be performed in O(nlog n) scalar operations, and ciphertext size is reduced at the same time. The CPA security of this scheme can be reduced into RLWE assumption.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2013-03-20: last updated; 2013-03-09: published
Short URL: https://ia.cr/2013/138
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2013/138,
      author = {Zhang Wei and Liu Shuguang and Yang Xiaoyuan},
      title = {Multi-bit homomorphic encryption based on  learning with errors over rings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/138},
      year = {2013},
      url = {https://eprint.iacr.org/2013/138}
}