Abstract
In this paper, we describe a practical cryptosystem based on an authentication tree. It is an extension of Ralph Merkle’s results [1]. The security of the system depends on assumptions on a one-way function. This cryptosystem allows to make interactive proofs of knowledge using keys only once. Thus, it can be used to prove one’s identity or to sign some message. A very efficient implementation can be done on a low-cost smart card. This cryptosystem is thus an alternative to the zero-knowledge algorithms.
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
R. Merkle: A Certified Digital Signature, in: Advances in Cryptology CRYPTO’89, Springer Verlag, 1989, 218–238.
R. Merkle: Protocols for Public Key Cryptosystems, in: Proc. IEEE Symp. on Security and Privacy,1980, 122–133.
W. Diffie, M. Hellman: New Directions in Cryptography, in: IEEE Transaction on Information Theory, vol. IT-22, 6, 1976, 644–654.
L. Lamport: Constructing digital signatures from a one way function, technical report CSL-98, SRI Intl., 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Wien
About this chapter
Cite this chapter
Vaudenay, S. (1993). One-Time Identification with Low Memory. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2786-5_19
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82519-8
Online ISBN: 978-3-7091-2786-5
eBook Packages: Springer Book Archive