Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 — if e(g,g)m(m−1)e(g,g)^{m(m-1)}e(g,g)m(m−1) has order 1 or qqq then m≡0m \equiv 0m≡0 or 1(modp)1 \pmod p1(modp)

Proved
GOSNIZK.BGNCommit.soundness_order_step

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

cryptographygroup-theorynumber-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (p,q,G,GT,e,g)(p, q, \mathbb G, \mathbb G_T, e, g)(p,q,G,GT​,e,g) be a BGN bilinear group with n=pqn = pqn=pq and let m∈Znm \in \mathbb Z_nm∈Zn​. If e(g,g)m(m−1)e(g,g)^{m(m-1)}e(g,g)m(m−1) has order 111 or qqq, that is,

(e(g,g)m(m−1))q=1,\big(e(g, g)^{m(m-1)}\big)^q = 1,(e(g,g)m(m−1))q=1,

then m≡0(modp)m \equiv 0 \pmod pm≡0(modp) or m≡1(modp)m \equiv 1 \pmod pm≡1(modp).

This is the step of the soundness proof where the hypothesis that e(g,g)e(g,g)e(g,g) generates GT\mathbb G_TGT​ is used: a degenerate pairing would make the conclusion fail.

Formalization Note "Has order 1 or qqq" is stated as "its qqq-th power is 111", which is equivalent since qqq is prime. The exponent m(m−1)m(m-1)m(m−1) is computed in Zn\mathbb Z_nZn​.

Preamble
import Mathlib
import Definitions.Def_GOSNIZK_BGNCommit_BGNSetup
import Definitions.Def_GOSNIZK_BGNCommit_Scheme
Formal statement
namespace GOSNIZK.BGNCommit

theorem soundness_order_step {G GT : Type*} [CommGroup G] [Fintype G] [CommGroup GT]
    [Fintype GT] (S : BGNSetup G GT) (m : ZMod S.n)
    (hord : (S.e S.g S.g ^ (m * (m - 1)).val) ^ S.q = 1) :
    S.toZp m = 0 ∨ S.toZp m = 1 := by sorry

end GOSNIZK.BGNCommit
Source
Groth, Ostrovsky, Sahai, New Techniques for Noninteractive Zero-Knowledge, J. ACM 59(3) (2012), authors' version of March 7, 2011, p. 9, proof of Theorem 2 (perfect soundness)
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