How much assurance does a PIN provide?

Lecture Notes in Computer Science

Volumn 3517, Issue , 2005, Pages 111-126

  Bentley, Jon ^a   Mallows, Colin ^a  

^a AVAYA LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER SATISFACTION; ENTROPY; SECURITY OF DATA;

AUTHENTICATION; NONUNIFORM DISTRIBUTIONS; PERSONAL IDENTIFICATION NUMBER (PIN); SHANNON ENTROPY;

HUMAN COMPUTER INTERACTION;

EID: 25144477790     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427896_8     Document Type: Conference Paper

References (16)

1. Becker, R. A., J. M. Chambers, A. R. Wilks [1988]. The New S Language: A Programming Environment for Data Analysis and Graphics, Wadsworth & Brooks/Cole, Pacific Grove, CA.
2. Bentley, J. L. and C. L. Mallows [2005]. Problem submitted to American Mathematical Monthly.
3. Bishop, M. and D. V. Klein [1995]. "Improving system security via proactive password checking," Computers and Security 14, 3, 1995, pp. 233-249.
4. Cachin, C. [1997]. "Entropy measures and unconditional security in cryptography," Ph.D. Thesis, ETH Zurich.
5. Chew, M. and H. S. Baird [2003]. "BaffleText: a Human Interactive Proof," Proceedings IS&T/SPI Document Recognition and Retrieval X Conference (ER&R 2003), Santa Clara, CA, January 2003.
6. Ellison, C., C. Hall, R. Milbert and B. Schneier [2000]. "Protecting secret keys with personal entropy," Future Generation Computer Systems 16, 4, February 2000, pp. 311-318.
7. Feldmeier, D. C. and P.R. Karn [1990]. "UNIX password security - ten years later," Advances in Cryptology - CRYPTO'89 Proceedings, Springer-Verlag, 1990, pp. 44-63.
8. Knuth, D. E. [1973]. The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA.
9. Mauer, U. M. [1996]. "A unified and generalized treatment of authentication theory," Proc. 13th Symposium on Theoretical Aspects of Computer Science (STAGS'96), Springer-Verlag LCNS 1046, pp. 387-398.
10. Morris, R. and K. Thompson [1979]. "Password security: A case history," Comm. ACM 22,.11, Nov. 1979, pp. 594-597.
11. O'Gorman, L., A. Bagga, and J. Bentley [2004]. "Call center customer verification by query-directed passwords," 8th Int. Financial Cryptography Conference, Florida, 9-12 Feb. 2004.
12. Shannon, C. E. [1948]. "A mathematical theory of communication," Bell System Tech. J. 27, July, October, 1948, pp.379-423,623-656, http://cm.bell-labs.com/cm/ms/what/shannonday/paper.html.
13. Shannon, C. E. [1949]. "Communication theory of secrecy systems," Bell System Tech. J. 28, October 1949, pp. 656-715.
14. Smith, R. E. [2002]. Authentication - From Passwords to Public Keys, Addison-Wesley, Boston, 2002, pp. 87-99.
15. Wischik, L [1996]. "The Paradox of the Surprise Examination", http://www.wischik.com/lu/ philosophy/surprise-exam.html.
16. Yan, J., A. Blackwell, R. Anderson, and A. Grant [2000]. "The memorability and security of passwords - some empirical results," TR 500, University of Cambridge, Computer Laboratory, September 2000, http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-500.pdf