Paper 2013/749

Efficient CCA-secure Threshold Public-Key Encryption Scheme

Xi-Jun Lin and 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. MINOR revision.
Keywords
Threshold public-key encryptionChosen-ciphertext securityHashed Diffie-Hellman assumption
Contact author(s)
linxj77 @ 163 com
History
2013-11-17: received
Short URL
https://ia.cr/2013/749
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2013/749}},
      url = {https://eprint.iacr.org/2013/749}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.