liveBook · Manning

Verifier

As explained in Real-World Cryptography

A verifier is the participant in a proof protocol who checks whether the prover has demonstrated the claimed statement or knowledge.

A verifier checks whether a prover has demonstrated a claimed statement or knowledge without necessarily learning the hidden witness. In a zero-knowledge proof, the verifier receives evidence rather than the secret itself. section 7.2

A verifier’s role can be seen in two stages:

  • Receive the prover’s claim and proof, such as evidence that Peggy knows a discrete logarithm without revealing the value. section 7.2
  • Supply or check the public portions of a protocol, while the prover supplies hidden inputs and intermediate values. section 15.3.9
  • Accept only when the combined information supports correct program execution or knowledge of the claimed witness. section 15.3.9 section 7.2

How Real-World Cryptography covers it

How deep it goes
Explains the role through discrete-log proofs and polynomial evaluations, stopping short of a complete verification algorithm.
Examples
Uses Victor checking Peggy’s knowledge and a verifier completing polynomial components in a zk-SNARK-style protocol.
What it assumes
Assumes familiarity with provers, witnesses, group elements, generators, and polynomial representations.
What you can do after
Evaluate whether a prover’s evidence supports the claimed knowledge or program output without requiring the hidden witness.
How it connects
Connects the verifier with the prover, proof of knowledge, zero-knowledge proofs, witnesses, and discrete logarithms.

Also explained in

Compare how 4 books explain verifier →

Related concepts

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.