In its simplest form, an identification protocol involves the presentation or submission of some information (a “secret value”) from a claimant to a verifier (see Identification). Challenge–response identification is an extension in which the information submitted by the claimant is the function of both a secret value known to the claimant (sometimes called a “prover”), and a challenge value received from the verifier (or “challenger”).
Such a challenge–response protocol proceeds as follows. A verifier V generates and sends a challenge value c to the claimant C. Using his/her secret value s and appropriate function f(), C computes the response value \(v=f {\rm (}c,s{\rm )}\), and returns v to V. V verifies the response value v, and if successful, the claim is accepted. Choices for the challenge value c, and additionally options for the function f() and secret s are discussed below.
Challenge–response identification is an improvement over simpler identification because it offers...
This is a preview of subscription content, log in via an institution to check access.
References
Menezes, A., P. van Oorschot, and S. Vanstone (1997). Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.
Stinson, D.R. (1995). Cryptography: Theory and Practice. CRC Press, Boca Raton, FL.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Just, M. (2005). Challenge–Response Identification. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_56
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_56
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering