Affordable Access

Access to the full text

Practical Human-Machine Identification over Insecure Channels

Authors
  • Li, Xiang-Yang1
  • Teng, Shang-Hua2, 3
  • 1 University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana, IL, 61801, USA , Urbana
  • 2 University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana, IL, 61801, USA; , Urbana
  • 3 University of Minnesota, Department of Computer Science, Minneapolis, MN, 55414, USA , Minneapolis
Type
Published Article
Journal
Journal of Combinatorial Optimization
Publisher
Springer-Verlag
Publication Date
Dec 01, 1999
Volume
3
Issue
4
Pages
347–361
Identifiers
DOI: 10.1023/A:1009894418895
Source
Springer Nature
Keywords
License
Yellow

Abstract

Human-machine identification is an important problem in cryptography that has applications in network access, electronic commerce, and smart-card design. It is a hard problem largely because human users have a very limited capacity in memorizing secrets and in performing protocols. Therefore, in addition to the requirement that a human-machine identification scheme must be provably secure, the scheme has to be practical in the sense that it must be feasible for a human user to participate. In this paper, we develop a new scheme for this problem. Our scheme improves upon some of the previously proposed human-machine identification schemes. We present a vigorous security analysis of our scheme. We also present some attacks to show previously proposed schemes could be vulnerable.

Report this publication

Statistics

Seen <100 times