Strong Solutions to the Identification Problem
- Cite this paper as:
- 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
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.
Unable to display preview. Download preview PDF.