This paper presents zero-knowledge proofs that begin with the verifier's challenge, indicating improved security against active attackers.
We present two simple zero-knowledge interactive proofs that can be instantiated with many of the standard decisional or computational hardness assumptions. Compared with traditional zero-knowledge proofs, in our protocols, the verifier starts first, by emitting a challenge, and then, the prover answers the challenge.
No takes yet. Share an insight, caveat, or question.
George Teşeleanu (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: