(Enter summary)
Abstract: The paper considers the problem of distributed key generation for shared-control RSA schemes.
In particular: how can two parties generate a shared RSA key in such a way that neither party
can cheat? The answer to this question would have significant applications to, for example,
key escrow systems. Cocks has recently proposed protocols to solve this problem in the case
when both parties act honestly. However, we show that the Cocks protocols [6] are insecure if a
dishonest party actively... (Update)
Cited by: More
Fast Three-Party Shared Generation of RSA Keys without.. - Ibrahim, Ibrahim.. (2004)
(Correct)
Fast Fully-Distributed and Threshold RSA Function Sharing - Ibrahim, Ibrahim, El-Sawy (2004)
(Correct)
Efficient Two Party Multi-Prime RSA Key Generation - Straub (2003)
(Correct)
Active bibliography (related documents): More All
0.4: Lecture Notes on Cryptography - Goldwasser, Bellare (1996)
(Correct)
0.3: H '8.a Rsa 53 - Hs Hsc Zb
(Correct)
0.2: Fully Distributed Threshold RSA under Standard Assumptions - Fouque, Stern
(Correct)
Similar documents based on text: More All
0.4: Equitable Key Escrow with Limited Time-Span (or, How to .. - Burmester, Desmedt.. (1998)
(Correct)
0.3: Equitability in Retroactive Key Confiscation versus.. - Desmedt, Burmester.. (2001)
(Correct)
0.3: Key Agreement Protocols and their Security Analysis - Blake-Wilson, Johnson, Menezes (1997)
(Correct)
Related documents from co-citation: More All
10: Split knowledge generation of RSA parameters (context) - Cocks
9: Efficient generation of shared RSA keys
- Boneh, Franklin
6: Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computatio.. (context) - BenOr, Goldwasser et al. - 1988
BibTeX entry: (Update)
Simon Blackburn, Simon Blake-Wilson, Mike Burmester, and Steven Galbraith, Shared generation of shared RSA keys, Technical Report CORR98-19, Department of Combinatorics & Optimization, University of Waterloo, 1998. http://citeseer.ist.psu.edu/blackburn98shared.html More
@misc{ blackburn98shared,
author = "S. Blackburn and S. Blake-Wilson and M. Burmester and S. Galbraith",
title = "Shared generation of shared RSA keys",
text = "Simon Blackburn, Simon Blake-Wilson, Mike Burmester, and Steven Galbraith,
Shared generation of shared RSA keys, Technical Report CORR98-19, Department
of Combinatorics & Optimization, University of Waterloo, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/blackburn98shared.html" }
Citations (may not include all citations):
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978
645
How to share a secret (context) - Shamir - 1979
411
How to prove yourself: Practical solutions to identification..
- Fiat, Shamir - 1987
250
How to play any mental game (context) - Goldreich, Micali et al. - 1987
194
Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
142
Federal Information Processing Standards Publication (context) - Digital - 1993
120
Robust threshold DSS signatures
- Gennaro, Jarecki et al. - 1996
80
Zero-knowledge undeniable signatures (context) - Chaum - 1991
64
Robust and efficient sharing of RSA functions
- Gennaro, Jarecki et al. - 1996
55
Efficient generation of shared RSA keys
- Boneh, Franklin - 1997
52
Foundations of Cryptography
- Goldreich - 1995
43
European Transactions on Telecommunications (context) - Desmedt - 1994
41
Fair public-key cryptosystems (context) - Micali - 1993
32
Lecture Notes in Cryptography
- Bellare, Goldwasser - 1996
22
Demonstrating possession of a discrete logarithm without rev.. (context) - Chaum, Evertse et al. - 1987
21
Split knowledge generation of RSA parameters (context) - Cocks - 1997
17
Efficient and secure multiparty generation of digital signat.. (context) - Cerecedo, Matsumoto et al. - 1993
13
On Diffie-Hellman key agreement with short exponents
- van Oorschot, Wiener - 1996
5
Split generation of RSA parameters with multiple participant.. (context) - Cocks - 1998
3
New ElGamal type threshold signature scheme (context) - Park, Kurosawa - 1996
1
Small exponents to polynomial equations (context) - Coppersmith - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cacr.math.uwaterloo.ca/techreports/1998/tech_reports98.html): More
An Application of Ramp Schemes to Broadcast Encryption - Stinson, Wei (1998)
(Correct)
Better Random Walks For Pollard's Rho Method - Teske (1998)
(Correct)
Elliptic Curve Pseudorandom Sequence Generators - Gong, Berson, Stinson (1998)
(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