Partially Interactive Threshold RSA Signatures
Long Hoang Nguyen abstract
In this paper, a new threshold signature scheme for RSA is proposed. The scheme does not require a trusted third party and no secure information is leaked throughout the protocol. The time and storage complexity of the protocol is linear in the number of parties and no restriction is placed on the RSA modulus. Combined with the n-out-of-n key generation protocol of Boneh and Franklin, one has a complete solution for the k-out-of-n threshold RSA problem with no trusted dealer.
infoinstitution | Oxford University Computing Laboratory |
month | March |
number | RR-06-01 |
year | 2006 |
links
BibTeX
related pages
|
