Practical Threshold RSA Signatures Without a Trusted Dealer

Practical Threshold RSA Signatures Without a Trusted Dealer (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ivan Damgård , Maciej Koprowski

Citations:

53 - 4 self

BibTeX

@INPROCEEDINGS{Damgård00practicalthreshold,
    author = {Ivan Damgård and Maciej Koprowski},
    title = {Practical Threshold RSA Signatures Without a Trusted Dealer},
    booktitle = {},
    year = {2000},
    pages = {152--165},
    publisher = {Springer Verlag}
}

OpenURL

Abstract

. We propose a threshold RSA scheme which is as e#cient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup's and in previous schemes can be dropped, namely that the modulus must be a product of safe primes and that a trusted dealer generates the keys. 1 Introduction In a threshold public-key system we have a standard public key (for the RSA system, for instance), while the private key is shared among a set of servers, in such a way that by collaborating, these servers can apply the private key operation to a given input, to decrypt it or sign it, as the case may be. If there are l servers, such schemes typically ensure that even if an active adversary corrupts less than l/2 servers, he will not learn additional information about the private key, and will be unable to force the network to compute incorrect results. Thus threshold cryptography is an important concept because it can improve substantially the reliability and security of ...

Keyphrases

trusted dealer practical threshold rsa signature private key threshold rsa scheme previous scheme previous threshold rsa scheme additional information active adversary corrupts incorrect result thus threshold cryptography standard public key threshold public-key system safe prime important concept private key operation rsa system