Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — (K, P, V) has perfect soundness

Proved
GOSNIZK.CircuitSound.lemma_7

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

circuit-satcryptographyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1zero-knowledge

Let a homomorphic proof commitment scheme have message space M=Z/NZ\mathcal M=\mathbb Z/N\mathbb ZM=Z/NZ with N≥4N\ge4N≥4, and assume the homomorphic property, perfect binding and perfect soundness of the 0/1 proof. Then the Circuit SAT proof (K,P,V)(K,P,V)(K,P,V) of Figure 3 has perfect soundness: for every (ck,xk)(ck,xk)(ck,xk) output by KbindingK_{\mathrm{binding}}Kbinding​, every NAND circuit CCC that has no satisfying assignment and every purported proof π\piπ,

V(ck,C,π)=0.V(ck,C,\pi)=0.V(ck,C,π)=0.

Soundness holds against unbounded provers, so the protocol is a proof, not only an argument, on binding keys.

Formalization Note The paper's Pr⁡[σ←K(1k);π←A(σ,xk):V(σ,xk,π)=1]=0\Pr[\sigma\leftarrow K(1^k);\pi\leftarrow\mathcal A(\sigma,x_k):V(\sigma,x_k,\pi)=1]=0Pr[σ←K(1k);π←A(σ,xk​):V(σ,xk​,π)=1]=0 for all adversaries is stated for every key in the support of KbindingK_{\mathrm{binding}}Kbinding​ and every π\piπ. The order bound N≥4N\ge4N≥4 is the paper's standing choice on p. 14; for N=3N=3N=3 the protocol of Figure 3 is not sound (the all-zero assignment passes every gate check).

Preamble
import Mathlib
import Definitions.Def_GOSNIZK_CircuitSound_Protocol
Formal statement
namespace GOSNIZK.CircuitSound

/-- Lemma 7 (Groth, Ostrovsky, Sahai, *New Techniques for Noninteractive Zero-Knowledge*, J. ACM
59(3) (2012), authors' version of March 7, 2011, p. 15): the protocol of Figure 3 has perfect
soundness, for a homomorphic, perfectly binding commitment whose 0/1 proof is perfectly sound and
whose message space has order at least 4. -/
theorem lemma_7 {N : ℕ} {R C CK XK TK Rp Prf : Type} [AddCommGroup R] [Fintype R] [CommGroup C] [Fintype C]
    [Fintype Rp] [Nonempty Rp] (S : Scheme N R C CK XK TK Rp Prf)
    (hN : 4 ≤ N) (hhom : S.Homomorphic) (hbind : S.PerfectBinding)
    (hsound01 : S.PerfectSoundness01) :
    S.CircuitPerfectSoundness := by sorry

end GOSNIZK.CircuitSound
Source
Groth, Ostrovsky, Sahai, New Techniques for Noninteractive Zero-Knowledge, J. ACM 59(3) (2012), authors' version of March 7, 2011, p. 15, Lemma 7
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me