Strong Solutions to the Identification Problem
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.
- 1.Garey, M., Johnson, D., Computers and Intractability, Freeman and Company (1979).Google Scholar
- 2.Goldreich, O., Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Springer (1999)Google Scholar
- 3.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)Google Scholar