Threshold Cryptosystems Based on $2^k$-th Power Residue Symbols

George Teseleanu

Paper 2023/601

Threshold Cryptosystems Based on $2^k$-th Power Residue Symbols

George Teseleanu

Abstract

In this paper we introduce a novel version of the Joye-Libert cryptosystem that allows users to decrypt without knowing the factorisation of the composite modulus. Then we use our construction as a building block for a threshold decryption protocol of the homomorphic Joye-Libert encryption scheme. Finally, we present several extensions of the threshold cryptosystem.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. SECRYPT 2023
Keywords: threshold decryption homomorphic encryption gap residuosity assumption
Contact author(s): george teseleanu @ yahoo com
History: 2023-04-28: approved; 2023-04-27: received; See all versions
Short URL: https://ia.cr/2023/601
License: CC BY-NC-SA

BibTeX

@misc{cryptoeprint:2023/601,
      author = {George Teseleanu},
      title = {Threshold Cryptosystems Based on $2^k$-th Power Residue Symbols},
      howpublished = {Cryptology ePrint Archive, Paper 2023/601},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/601}},
      url = {https://eprint.iacr.org/2023/601}
}