A Generalization of Paillier's Public-Key System With Fast Decryption

Ying Guo; Zhenfu Cao; Xiaolei Dong

Paper 2020/796

A Generalization of Paillier's Public-Key System With Fast Decryption

Ying Guo, Zhenfu Cao, and Xiaolei Dong

Abstract

Paillier's scheme is a homomorphic public key encryption scheme which is widely used in practical. For instance, Paillier's scheme can be used in the data aggregation in smart grid. Damgrd and Jurik generalized Paillier's scheme to reduce the ciphertext expansion factor. However, the decryption scheme of Damgrd and Jurik's scheme is more complicated than Paillier's original scheme. In this paper, we propose a new generalization of Paillier's scheme and all the Paillier's schemes to our knowledge are special cases of our scheme. We propose a very simple decryption algorithm which is more efficient than other generalization algorithms. We prove that our generalized Paillier's scheme is IND-CPA secure. Our generalized Paillier's scheme can be used in smart grid instead of Paillier's scheme for higher flexibility.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: public-key cryptography discrete logarithm problem
Contact author(s): sjtuguoying @ 126 com
History: 2020-12-18: revised; 2020-06-27: received; See all versions
Short URL: https://ia.cr/2020/796
License: CC BY

BibTeX

@misc{cryptoeprint:2020/796,
      author = {Ying Guo and Zhenfu Cao and Xiaolei Dong},
      title = {A Generalization of Paillier's Public-Key System With Fast Decryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/796},
      year = {2020},
      url = {https://eprint.iacr.org/2020/796}
}