Abstract
Cocks proposed a protocol for two parties to jointly generate a shared RSA key. His protocol was designed under the assumption that both parties follow the protocol. Cocks proposed a modification to the protocol to prevent certain attacks by an active adversary. The paper presents attacks that show that the Cocks protocols are not secure when one party deviates from the protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare and S. Goldwasser, Lecture Notes in Cryptography. 1996. Available at http://www-cse.ucsd.edu/users/mihir/
S.R. Blackburn, S. Blake-Wilson, M. Burmester and S.D. Galbraith, ‘Shared generation of shared RSA keys’ Technical report CORR 98-19, University of Waterloo. Available from http://www.cacr.math.uwaterloo.ca/
D. Boneh and M. Franklin, ‘Efficient generation of shared RSA keys’, in B.S. Kaliski Jr., editor, Advances in Cryptology-CRYPTO ‘97, Lecture Notes in Computer Science Vol. 1294, Springer-Verlag, 1997, pp. 425–439.
C. Cocks, ‘Split knowledge generation of RSA parameters’, in M. Darnell, editor, Cryptography and Coding: 6th IMA Conference, Lecture Notes in Computer Science Volume 1355, Springer-Verlag, 1997, pp. 89–95.
C. Cocks, ‘Split generation of RSA parameters with multiple participants’, 1998. Available at http://www.cesg.gov.uk
D.E. Denning and D.K. Branstad, ‘A taxonomy of key escrow encryption schemes’, Communications of the A.C.M., Vol. 39,No.1 (1996), pp. 24–40.
A. Fiat and A. Shamir, ‘How to prove yourself: Practical solutions to identification and signature problems’, in A.M. Odlyzko, editor, Advances in Cryptology-CRYPTO ‘86, Lecture Notes in Computer Science Vol. 263, Springer-Verlag, 1987, pp. 186–194.
Y. Frankel, P.D. MacKenzie, M. Yung, ‘Robust efficient distributed RSA key generation’, In Proc. of 30th STOC, 1998, pp. 663–672.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, ‘Robust and efficient sharing of RSA functions’, in N. Koblitz, editor, Advances in Cryptology-CRYPTO’ 96, Lecture Notes in Computer Science 1109, Springer-Verlag, 1996, pp. 157–172.
N. Gilboa, ‘Two party RSA key generation’, in M. Weiner, editor, Advances in Cryptology-CRYPTO’ 99, Lecture Notes in Computer Science 1666, Springer-Verlag 1999, pp. 116–129.
G. Poupard, J. Stern, ‘Generation of shared RSA keys by two parties’, In ASI-ACRYPT’ 98, 1998, pp. 357–371.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blackburn⋆, S.R., Burmester, M., Galbraith⋆⋆⋆, S., Blake-Wilson⋆⋆, S. (1999). Weaknesses in Shared RSA Key Generation Protocols. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_34
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive