Paper 2012/075

Efficient identity-based threshold decryption scheme from bilinear pairings

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


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.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Identity-based cryptographyThreshold cryptographyProvable securityRandom oracle modelBilinear pairingIdentity-based threshold decryption
Contact author(s)
wangxuyuyan @ gmail com
2012-02-26: revised
2012-02-23: received
See all versions
Short URL
Creative Commons Attribution


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