Efficient CCA-secure Threshold Public-Key Encryption Scheme

Xi-Jun Lin; Lin Sun

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

Efficient CCA-secure Threshold Public-Key Encryption Scheme

Xi-Jun Lin

Lin Sun

Abstract

In threshold public-key encryption, the decryption key is divided into n shares, each one of which is given to a different decryption user in order to avoid single points of failure. In this study, we propose a simple and efficient non-interactive threshold public-key encryption scheme by using the hashed Diffie-Hellman assumption in bilinear groups. Compared with the other related constructions, the proposed scheme is more efficient.

Metadata

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

BibTeX

@misc{cryptoeprint:2013/749,
      author = {Xi-Jun Lin and Lin Sun},
      title = {Efficient CCA-secure Threshold Public-Key Encryption Scheme},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/749},
      year = {2013},
      url = {https://eprint.iacr.org/2013/749}
}