Abstract
By modifying the private key and the public key setting in Boneh-Lynn-Shacham's short signature shcheme, a variation of BLS' short signature scheme is proposed. Based on this variation, we present a very efficient threshold signature scheme where the number of pairing computation for the signaure share verification reduces to half.
| Original language | English |
|---|---|
| Pages (from-to) | 1720-1723 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E92-A |
| Issue number | 7 |
| DOIs | |
| State | Published - 2009 |
Keywords
- Bilinear pairing
- Digital signature
- Discrete logarithm problem
- Threshold signature