Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6 — with perfect extractability, the wire values extracted from an accepted proof satisfy the circuit

Proved
GOSNIZK.CircuitSound.knowledge_extraction

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, perfect soundness of the 0/1 proof and perfect extractability. Let E1=KbindingE_1=K_{\mathrm{binding}}E1​=Kbinding​ and let E2(σ,xk,C,π)E_2(\sigma,xk,C,\pi)E2​(σ,xk,C,π) set wi=1w_i=1wi​=1 iff Extxk(ci)=1\mathrm{Ext}_{xk}(c_i)=1Extxk​(ci​)=1. Then for every (ck,xk)(ck,xk)(ck,xk) output by KbindingK_{\mathrm{binding}}Kbinding​, every NAND circuit CCC and every proof π\piπ with V(ck,C,π)=1V(ck,C,\pi)=1V(ck,C,π)=1,

C(E2(ck,xk,C,π))=1.C\big(E_2(ck,xk,C,\pi)\big)=1.C(E2​(ck,xk,C,π))=1.

So the protocol of Figure 3 is a perfect proof of knowledge.

Formalization Note The extractor is fixed to the one in the paper's proof; an unspecified extractor would make the claim follow from soundness by exhaustive search, which is not what the paper proves.

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

/-- Perfect knowledge extraction (Groth, Ostrovsky, Sahai, *New Techniques for Noninteractive
Zero-Knowledge*, J. ACM 59(3) (2012), authors' version of March 7, 2011, proof of Theorem 6, p. 15):
if the commitment scheme is perfectly extractable, the wire values extracted from the commitments of
an accepted proof satisfy the circuit, on every binding key. -/
theorem knowledge_extraction {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) (hext : S.PerfectExtractability) :
    S.CircuitPerfectKnowledgeExtraction := 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, proof of Theorem 6 (second paragraph)
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