Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 — the BGN commitment is homomorphic on either type of key

Proved
GOSNIZK.BGNCommit.com_homomorphic

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

commitment-schemescryptographyp2o-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 hhh be a perfectly binding key (h=gpxh = g^{px}h=gpx, x∈Zq∗x \in \mathbb Z_q^*x∈Zq∗​) or a perfectly hiding key (h=gxh = g^xh=gx, x∈Zn∗x \in \mathbb Z_n^*x∈Zn∗​). Then for all messages m1,m2∈Znm_1, m_2 \in \mathbb Z_nm1​,m2​∈Zn​ and randomizers r1,r2∈Znr_1, r_2 \in \mathbb Z_nr1​,r2​∈Zn​,

com(m1+m2;r1+r2)=com(m1;r1) com(m2;r2).\mathrm{com}(m_1 + m_2; r_1 + r_2) = \mathrm{com}(m_1; r_1)\,\mathrm{com}(m_2; r_2).com(m1​+m2​;r1​+r2​)=com(m1​;r1​)com(m2​;r2​).

This is the homomorphic property of a homomorphic proof commitment, the property that lets the Circuit-SAT proofs of the paper combine commitments to wire values.

Formalization Note Messages are taken in Zn\mathbb Z_nZn​ (see the definition of the scheme).

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

theorem com_homomorphic {G GT : Type*} [CommGroup G] [Fintype G] [CommGroup GT] [Fintype GT]
    (S : BGNSetup G GT) (h : G) (hkey : S.IsBindingKey h ∨ ∃ x, S.IsHidingKey h x)
    (m₁ r₁ m₂ r₂ : ZMod S.n) :
    S.com h (m₁ + m₂) (r₁ + r₂) = S.com h m₁ r₁ * S.com h m₂ r₂ := 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
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