Secure Human Identification Protocols
One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of protocols for secure identification which require various forms of trusted hardware or software, aimed at protecting privacy and financial assets. But how do we verify our identity, securely, when we don’t have or don’t trust our smart card, palmtop, or laptop?
In this paper, we provide definitions of what we believe to be reasonable goals for secure human identification. We demonstrate that existing solutions do not meet these reasonable definitions. Finally, we provide solutions which demonstrate the feasibility of the security conditions attached to our definitions, but which are impractical for use by humans.
KeywordsSmart Card Hash Table Gaussian Elimination Security Condition Secure Human
- 2.Lamport, L.: Password authentication with insecure communication. Communications of the ACM 24 (1981)Google Scholar
- 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–421Google Scholar
- 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–392Google Scholar
- 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–75Google Scholar
- 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–10Google Scholar
- 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–401Google Scholar
- 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)Google Scholar
- 12.McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, Jet Propulsion Laboratory (1978) Deep Space Network Progress Report.Google Scholar
- 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–83Google Scholar