Efficient identity-based threshold decryption  scheme from bilinear pairings

Wei Gao; Guilin Wang; Kefei Chen; Xueli Wang; Guoyan Zhang

Paper 2012/075

Efficient identity-based threshold decryption scheme from bilinear pairings

Wei Gao, Guilin Wang, Kefei Chen, Xueli Wang, and Guoyan Zhang

Abstract

Taking advantage of a technique that allows to safely distribute a private key among decryption servers we introduce a new identity-based threshold scheme, proven secure in the random oracle model. This new paring-based scheme features a lot of improvements compared to other schemes that can be found in the literature. Among them the two most noticeable ones are, the efficiency, by reducing the number of pairing computations, and the ability for a user to generate and share a private key without requiring any access to a PKG.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Identity-based cryptography Threshold cryptography Provable security Random oracle model Bilinear pairing Identity-based threshold decryption
Contact author(s): wangxuyuyan @ gmail com
History: 2012-02-26: revised; 2012-02-23: received; See all versions
Short URL: https://ia.cr/2012/075
License: CC BY

BibTeX

@misc{cryptoeprint:2012/075,
      author = {Wei Gao and Guilin Wang and Kefei Chen and Xueli Wang and Guoyan Zhang},
      title = {Efficient identity-based threshold decryption  scheme from bilinear pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/075},
      year = {2012},
      url = {https://eprint.iacr.org/2012/075}
}