Efficient Identity-Based Threshold Decryption Scheme From Bilinear Pairings

Taking advantage of a technique that allows to safely distribute a private key among decryption servers the authors 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 this paper. Among them the two most noticeable ones are, the efficiency, by drastically 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.

Provided by: Shanghai Jiao Tong University Topic: Security Date Added: Feb 2012 Format: PDF

Find By Topic