You are looking at a specific version 20120226:231348 of this paper.
See the latest version.
Paper 2012/075
Efficient identity-based threshold decryption scheme from bilinear pairings
Wei Gao and Guilin Wang and Kefei Chen and 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)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Identity-based cryptographyThreshold cryptographyProvable securityRandom oracle modelBilinear pairingIdentity-based threshold decryption
- Contact author(s)
- wangxuyuyan at gmail com
- History
- 2012-02-26: revised
- 2012-02-23: received
- See all versions
- Short URL
- https://ia.cr/2012/075
- License
-
CC BY