Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.7 — a biometric embedding with recovery information transfers average-case secure sketches

Proved
FuzzyExtractors.EditSketch.lemma_4_7

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

biometric-embeddingmin-entropyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let M1,M2\mathcal M_1, \mathcal M_2M1​,M2​ be spaces with integer distances dis1,dis2\mathrm{dis}_1, \mathrm{dis}_2dis1​,dis2​. Let f:M1→M2f : \mathcal M_1 \to \mathcal M_2f:M1​→M2​ be a (t1,t2,λ)(t_1, t_2, \lambda)(t1​,t2​,λ)-biometric embedding with recovery information ggg, and let (SS,Rec)(\mathsf{SS}, \mathsf{Rec})(SS,Rec) be an average-case (M2,m1−λ,m~2,t2)(\mathcal M_2, m_1 - \lambda, \tilde m_2, t_2)(M2​,m1​−λ,m~2​,t2​) secure sketch. Define

SS′(w)=(SS(f(w)),g(w)),\mathsf{SS}'(w) = (\mathsf{SS}(f(w)), g(w)),SS′(w)=(SS(f(w)),g(w)),

and let Rec′(w′,(s,r))\mathsf{Rec}'(w', (s, r))Rec′(w′,(s,r)) compute Rec(f(w′),s)\mathsf{Rec}(f(w'), s)Rec(f(w′),s) to obtain f(w)f(w)f(w) and then invert (f(w),r)(f(w), r)(f(w),r) to obtain www. Then (SS′,Rec′)(\mathsf{SS}', \mathsf{Rec}')(SS′,Rec′) is an average-case (M1,m1,m~2,t1)(\mathcal M_1, m_1, \tilde m_2, t_1)(M1​,m1​,m~2​,t1​) secure sketch.

This lemma moves secure sketches across metric spaces: Theorem 7.5 applies it with shingling as fff and PinSketch as (SS,Rec)(\mathsf{SS}, \mathsf{Rec})(SS,Rec).

Formalization Note. The paper prints "computing Rec(w′,s)\mathsf{Rec}(w', s)Rec(w′,s) to get f(w)f(w)f(w)"; Rec\mathsf{Rec}Rec acts on M2\mathcal M_2M2​, so it is read as Rec(f(w′),s)\mathsf{Rec}(f(w'), s)Rec(f(w′),s). Inverting (y,r)(y, r)(y,r) chooses the www with f(w)=yf(w) = yf(w)=y and g(w)=rg(w) = rg(w)=r, which is unique by Definition 7; if no such www exists, w′w'w′ is returned (this case does not arise under correctness). The paper's proof treats only the worst-case entropy hypothesis; the average-case statement, which is what the lemma asserts, is stated. λ\lambdaλ is real, and "range size at most 2λ2^\lambda2λ" is the existence of a finite set of at most 2λ2^\lambda2λ elements containing every value of ggg. No metric axioms or finiteness are assumed.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_EditSketch_Basic
Formal statement
namespace FuzzyExtractors.EditSketch

theorem lemma_4_7 {M₁ M₂ G S : Type} (dis₁ : M₁ → M₁ → ℕ) (dis₂ : M₂ → M₂ → ℕ)
    (t₁ t₂ : ℕ) (lam m₁ m₂' : ℝ) (f : M₁ → M₂) (g : M₁ → G)
    (SS : M₂ → PMF S) (Rec : M₂ → S → PMF M₂)
    (hf : IsEmbeddingWithRecovery dis₁ dis₂ t₁ t₂ lam f g)
    (hSS : FuzzyExtractors.Hamming.IsAvgSecureSketch dis₂ (m₁ - lam) m₂' t₂ SS Rec) :
    FuzzyExtractors.Hamming.IsAvgSecureSketch dis₁ m₁ m₂' t₁ (embedSketch f g SS) (embedRec f g Rec) := by sorry

end FuzzyExtractors.EditSketch
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Lemma 4.7, p. 15
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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