Abstract
This work proposes two identification algorithms based on some difficult problems. The first scheme is an extremely simple combination of the idea of one-time passwords and the use of public keys. The second proposal allows identification to be implemented without leaking any secret information during the interaction because it combines the two mentioned concepts with a zero-knowledge proof of the possession of a solution to a difficult graph problem through a challenge-response technique.
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
Garey, M., Johnson, D., Computers and Intractability, Freeman and Company (1979).
Goldreich, O., Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Springer (1999)
Goldreich, O., Micali, S., Wigderson, A., Howto Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design, Advances in Cryptology-CRYPTO’ 86, 171. Springer-Verlag (1986)
Goldwasser, S., Micali, S., Rackoff, C., The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18, 186–208 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caballero-Gil, P., Hernández-Goya, C. (2001). Strong Solutions to the Identification Problem. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive