A Secure Human-Computer Authentication Scheme

Abstract

We introduce a protocol for authentication between a human and a computer, where the human is able to use no special hardware other than a dumb terminal. Authentication is based on a shared secret which can be reused polynomially often with no danger of exposure, assuming the conjectured uniform hardness of learning parity functions in the presence of noise. Under this conjecture, the protocol is secure against a polynomially-bounded passive adversary and also some forms of active adversary, although it is not secure against arbitrary active adversaries.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 2000
Accession Number
ADA382135

Entities

People

  • Manuel Blum
  • Nicholas J. Hopper

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Authentication
  • Computations
  • Computer Science
  • Computers
  • Concrete
  • Construction
  • Elimination
  • Hardness
  • Iterations
  • Learning
  • Materials
  • Polynomials
  • Probability
  • Random Variables
  • Security

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Enterprise Information Systems Architecture and Joint Command Capability Interoperability Support.