Abstract
This paper describes an implementation of a cipher system with any number of keys which is a generalisation of the RSA cryptosystem. Three applications of such a cipher system are given. The general properties required for possible alternative implementations are discussed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
6 References
C.A. Boyd, Digital Multisignatures, IMA Conference On Cryptography and Coding, Cirencester, December 1986.
D.L. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Comm.ACM, 24,2, (1981), 84–88.
D.L. Chaum, Blind signatures for untraceable payments, Proceedings of Crypto 82, Plenum Press 1983, pp.199–203.
J.D. Cohen & M.J. Fischer, A Robust and Verifiable Cryptographically Secure Election Scheme, Proceedings of IEEE Conference on Foundations of Computer Science, 1985.
Y. Desmedt, Society and Group Oriented cryptography, Proceedings of Crypto 87.
W. Diffie & M. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22,6, 1976.
R. Rivest, A. Shamir & L. Adelman, A method for obtaining digital signatures and public key cryptosystems, Comm.ACM 21,2 (1978), 120–126.
G.J. Simmons, How to (selectively) broadcast a secret, Proceedings of IEEE Conference on Security and Privacy 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyd, C. (1988). Some Applications of Multiple Key Ciphers. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_40
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive