Authentication challenge

As explained in Real-World Cryptography

A challenge is verifier-generated randomness sent to a prover to constrain the prover's response in an interactive proof.

A verifier can stop a prover from preparing a fake answer by adding an unpredictable question. In an interactive proof, this verifier-generated random value is the authentication challenge: it constrains the prover’s response and helps establish knowledge of a hidden witness. section 7.2.1

A challenge-based identification exchange follows this pattern:

• The prover commits to random value k before seeing the verifier’s randomness. section 7.2.1
• The verifier generates random value c and sends it as the challenge. section 7.2.1
• The prover uses k and c to compute the response s; without c, a prover lacking the witness cannot complete the final step. section 7.2.1

Why the question matters

In the Schnorr identification protocol, Peggy first commits to k, then Victor sends c. This prevents Peggy from choosing an answer based on an inverse or other shortcut after seeing the verification target. section 7.2.1

Figure 7.6 The Schnorr identification protocol is an interactive ZKP that is complete (Peggy can prove she knows some witness), sound (Peggy cannot prove anything if she doesn’t know the witness), and zero-knowledge (Victor learns nothing about the witness).

Use the protocol diagram to connect the challenge with completeness, soundness, and zero-knowledge. section 7.2.1

How Real-World Cryptography covers it

How deep it goes

Explains commitment, random challenge, and response steps, but stops short of formal proof details.

Examples

Uses Peggy, Victor, random values k and c, response s, and the Schnorr identification protocol.

What it assumes

Assumes familiarity with prover, verifier, witness, and commitment schemes while introducing challenge behavior through an example.

What you can do after

Evaluate how verifier randomness prevents a prover from adapting a response after seeing the verification target.

How it connects

Connects interactive zero-knowledge proofs with commitment schemes, Sigma protocols, and the Schnorr identification protocol.

liveBookmanning.com

Read Real-World Cryptography on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Software Security for DevelopersAn authentication challenge is a fresh, unpredictable value supplied during an authentication ceremony to bind the response to that specific ceremony and demonstrate possession of a credential.

Compare how 2 books explain authentication challenge →

Related concepts

• protocoluses · A protocol is a defined set of rules and conventions governing communication or interaction among systems, components, or participants.
• cryptographic primitiveuses · A cryptographic primitive is a fundamental algorithmic building block that provides a basic security function such as encryption, hashing, or digital signing.
• WebAuthnused by · WebAuthn is a web authentication standard and browser API that enables public-key authentication using credentials managed by platform or external authenticators.
• sigma protocolpart of · A sigma protocol is an interactive proof pattern consisting of a prover commitment, a verifier challenge, and a prover response.
• authentication flowpart of · An authentication flow is an ordered sequence of interactions through which a system verifies an entity’s identity and establishes authenticated access.
• replay attackaddresses · A replay attack is an attack in which previously captured valid messages, requests, or authentication data are retransmitted to produce an unauthorized effect.

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.