(Enter summary)
Abstract: We present an RSA threshold signature scheme. The scheme enjoys
the following properties:
1. it is unforgeable and robust in the random oracle model, assuming
the RSA problem is hard;
2. signature share generation and verification is completely noninteractive;
3. the size of an individual signature share is bounded by a constant
times the size of the RSA modulus. (Update)
Cited by: More
Generic On-line/O-line Threshold Signatures - Chris Crutchfield David
(Correct)
Monotone Signatures - Published In Syverson
(Correct)
Fast Authenticated Key Establishment Protocols for .. - Huang, Cukier.. (2003)
(Correct)
Similar documents (at the sentence level):
68.4%: Practical Threshold Signatures - Shoup (1999)
(Correct)
Active bibliography (related documents): More All
0.2: On Protocol Security in the Cryptographic Model - Nielsen (2003)
(Correct)
0.1: Some Recent Research Aspects of Threshold Cryptography - Desmedt (1997)
(Correct)
0.1: A Simplified Approach to Threshold and Proactive RSA - Rabin
(Correct)
Similar documents based on text: More All
0.4: Using Hash Functions as a Hedge against Chosen Ciphertext Attack - Shoup (2000)
(Correct)
0.4: A Composition Theorem for Universal One-Way Hash Functions - Shoup (1999)
(Correct)
0.4: Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000)
(Correct)
Related documents from co-citation: More All
48: How to Share a Secret (context) - Shamir - 1979
29: A method for obtaining digital signatures and public-key cryptosystems; Communic..
- Rivest, Shamir et al. - 1978
23: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols
- Bellare, Rogaway - 1993
BibTeX entry: (Update)
V. Shoup, \Practical threshold signatures", to appear. http://citeseer.ist.psu.edu/shoup99practical.html More
@article{ shoup00practical,
author = "Victor Shoup",
title = "Practical Threshold Signatures",
journal = "Lecture Notes in Computer Science",
volume = "1807",
pages = "207--??",
year = "2000",
url = "citeseer.ist.psu.edu/shoup99practical.html" }
Citations (may not include all citations):
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978
659
Random oracles are practical: a paradigm for designing effic..
- Bellare, Rogaway - 1993
645
How to share a secret (context) - Shamir - 1979
411
How to prove yourself: practical solutions to identification..
- Fiat, Shamir - 1987
193
Threshold cryptosystems (context) - Desmedt, Frankel - 1989
186
A public key cryptosystem and signature scheme based on disc.. (context) - Gamal - 1985
166
Wallet databases with observers (context) - Chaum, Pedersen - 1992
133
A practical scheme for non-interactive verifiable secret sha.. (context) - Feldman - 1987
124
Lower bounds for discrete logarithms and related problems
- Shoup - 1997
84
Society and group oriented cryptography: a new concept (context) - Desmedt - 1987
75
Shared generation of authenticators and signatures (context) - Desmedt, Frankel - 1991
73
Optimalresilience proactive public-key cryptosystems
- Frankel, Gemmall et al. - 1997
64
Robust and efficient sharing of RSA functions
- Gennaro, Jarecki et al. - 1996
61
A simplified approach to threshold and proactive RSA
- Rabin - 1998
55
Number-theoretic constructions of efficient pseudo-random fu..
- Naor, Reingold - 1997
49
Proactive RSA
- Frankel, Gemmall et al. - 1997
42
How to share a function securely (context) - De Santis, Desmedt et al. - 1994
29
Parallel reliable threshold multisignature
- Frankel, Desmedt - 1992
11
Publicly verifiable secrete sharing (context) - Stadler - 1996
4
Robust threshold DSS (context) - Gennaro, Jarecki et al. - 1996
3
threshold digitial signature scheme and digital multisignatu.. (context) - Harn - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999)
(Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997)
(Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC