Secure human identification protocols

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

Volumn 2248, Issue , 2001, Pages 52-66

  Hopper, Nicholas J ^a   Blum, Manuel ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SMART CARDS;

COMMUNITY IS; FINANCIAL ASSETS; HUMAN IDENTIFICATION; SECURE AUTHENTICATIONS; TRUSTED HARDWARES;

CRYPTOGRAPHY;

EID: 70349284581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_4     Document Type: Conference Paper

References (13)

1. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In Odlyzko, A.M., ed.: Advances in Cryptology— CRYPTO ’86. Volume 263 of Lecture Notes in Computer Science., Springer-Verlag, 1987 (1986) 186–194
2. Lamport, L.: Password authentication with insecure communication. Communications of the ACM 24 (1981)
3. Matsumoto, T., Imai, H.: Human identification through insecure channel. In Davies, D.W., ed.: Advances in Cryptology—EUROCRYPT' 91. Volume 547 of Lecture Notes in Computer Science., Springer-Verlag (1991) 409–421
4. Wang, C.H., Hwang, T., Tsai, J.J.: On the Matsumoto and Imai’s human identification scheme. In Guillou, L.C., Quisquater, J.J., eds.: Advances in Cryptology— EUROCRYPT '95. Volume 921 of Lecture Notes in Computer Science., Springer- Verlag (1995) 382–392
5. Matsumoto, T.: Human-computer cryptography: An attempt. In Neuman, C., ed.: 3rd ACM Conference on Computer and Communications Security, New Delhi, India, ACM Press (1996) 68–75
6. Naor, M., Pinkas, B.: Visual authentication and identification. In Kaliski Jr., B.S., ed.: Advances in Cryptology—CRYPTO ’97. Volume 1294 of Lecture Notes in Computer Science., Springer-Verlag (1997) 322–336
7. Goldreich, O.: Foundations of cryptography (fragments of a book). Available electronically at http://theory.lcs.mit.edu/˜oded/frag.html (1998)
8. Håstad, J.: Some optimal inapproximability results. In: Proceedings of the Twenty- Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas (1997) 1–10
9. Kearns, M.: Efficient noise-tolerant learning from statistical queries. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, San Diego, California (1993) 392–401
10. Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In Stinson, D.R., ed.: Advances in Cryptology— CRYPTO ’93. Volume 773 of Lecture Notes in Computer Science., Springer-Verlag (1993) 278–291
11. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, Oregon (2000)
12. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, Jet Propulsion Laboratory (1978) Deep Space Network Progress Report.
13. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. In: Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, Baltimore, Maryland (1990) 73–83