Abstract
We show how it is possible for two parties to co-operate in generating the parameters for an RSA encryption system in such a way that neither individually has the ability to decrypt enciphered data. In order to decrypt data the +two parties instead follow the co-operative procedure described.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Boneh and M. Franklin Efficient Generation of Shared RSA Keys. In Advances in Cryptology — Crypto 97 Lecture Notes in Computer Science vol 1294, pp 425–439.
S. Micali Fair Cryptosystems. MIT Technical report MIT/LCS/TR-579.h, November 1993.
A. Fiat and A. Shamir How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology — Crypto 86 Lecture Notes in Computer Science vol 263, pp 186–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cocks, C. (1997). Split knowledge generation of RSA parameters. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024452
Download citation
DOI: https://doi.org/10.1007/BFb0024452
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63927-5
Online ISBN: 978-3-540-69668-1
eBook Packages: Springer Book Archive