Identity-based threshold signature scheme from the bilinear pairings (extended abstract)
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 196, 124-128 Vol.1
- https://doi.org/10.1109/itcc.2004.1286437
Abstract
The focus of this paper is to formalize the concept of identity-based threshold signature and give the first provably secure scheme based on the bilinear pairings. An important feature of our scheme is that a private key associated with an identity rather than a master key of the public key generator is shared among signature generation servers, which is more desirable in practice. Another interesting aspect of our results is that the security of one of the verifiable secret sharing schemes used to construct the identity-based threshold signature scheme is relative to a slightly modified version of the generalized Tate inversion problem recently proposed by Joux.Keywords
This publication has 4 references indexed in Scilit:
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- A practical scheme for non-interactive verifiable secret sharingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- How to share a secretCommunications of the ACM, 1979