Strong solutions to the identification problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 257-261

  Caballero Gil, Pino ^a   Hernández Goya, Candelaria ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHALLENGE RESPONSE TECHNIQUES; GRAPH PROBLEMS; IDENTIFICATION ALGORITHMS; IDENTIFICATION PROBLEM; ONE TIME PASSWORDS; SECRET INFORMATION; STRONG SOLUTION; ZERO KNOWLEDGE PROOF;

COMBINATORIAL MATHEMATICS;

EID: 84944044888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_28     Document Type: Conference Paper

References (4)

1. Garey, M., Johnson, D., Computers and Intractability, Freeman and Company (1979).
2. Goldreich, O., Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Springer (1999)
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)
4. Goldwasser, S., Micali, S., Rackoff, C., The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18, 186-208 (1989).