Most schemes for the verification of personal identity are logically flawed in that they require an individual to exhibit a piece of private, i.e., secret, infor- mation such as a computer access password, a telephone credit card number, a per- sonal identification number (PIN), etc., to prove his identity. The logical problem is that this information, once exhibited, is potentially compromised and. could be used by anyone to undetectably impersonate the legitimate owner. What is needed is a protocol that will allow an individual to “prove” that he knows the secret piece of information, whose possession is equated with his identity, without revealing anything about the information itself which could aid a would-be cheater to imper- sonate him. Several investigators have proposed identification schemes to accom- plish this [ 1, 2, 3, 4 ] that depend on interactive-proof schemes, often referred to as zero-knowledge proofs or ping-pong protocols, in which the individual responds to a series of queries in a way that the legitimate user could, but which an impostor (probably) could not. We describe a simpler identity verification scheme which uses a public authentication channel to validate a private authentication channel belong- ing to the individual who wishes to prove his identity. The public and the private channels can be completely independent and can even be based on different authen- tication algorithms, or they can both be of the same type. This scheme also pro- vides certified receipts for transactions whose legitimacy can later be verified by impartial arbiters who were not involved in the transaction itself.
CITATION STYLE
Simmons, G. J. (1988). An impersonation-proof identity verification scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 211–215). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_17
Mendeley helps you to discover research relevant for your work.