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

George Teseleanu

Paper 2023/601 Original: eprint.iacr.org/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: Preprint.
History: 2023-04-27: last updated; 2023-04-27: published
Short URL: https://ia.cr/2023/601
License: https://creativecommons.org/licenses/by-nc-sa/4.0/

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},
      url = {https://eprint.iacr.org/2023/601}
}