Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — a correct sketch with at most 2λ2^\lambda2λ outputs is an average-case secure sketch with entropy loss λ\lambdaλ

Proved
FuzzyExtractors.Hamming.lemma_3_1

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

min-entropyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) be randomized procedures on a space M\mathcal MM with distance dis\mathrm{dis}dis that satisfy the correctness property of a secure sketch for some ttt, and suppose the output range of SS\mathsf{SS}SS has size at most 2λ2^\lambda2λ: some finite set TTT with ∣T∣≤2λ|T|\le 2^\lambda∣T∣≤2λ contains every possible output of SS(w)\mathsf{SS}(w)SS(w), for every www. Then for every min-entropy threshold mmm,

(SS,Rec) is an average-case (M,m,m−λ,t)-secure sketch.(\mathsf{SS},\mathsf{Rec}) \text{ is an average-case } (\mathcal M, m, m-\lambda, t)\text{-secure sketch.}(SS,Rec) is an average-case (M,m,m−λ,t)-secure sketch.

So the entropy loss of a correct sketch is bounded by its length, uniformly in mmm. This is how the syndrome construction is analysed.

Formalization Note λ\lambdaλ is real and the sketch takes values in an arbitrary set. The paper's parenthetical case, a sketch that is a λ\lambdaλ-bit string, is an instance of the size hypothesis. "Correctness for some ttt" is the hypothesis that Rec(w′,s)=w\mathsf{Rec}(w',s)=wRec(w′,s)=w whenever dis(w,w′)≤t\mathrm{dis}(w,w')\le tdis(w,w′)≤t and sss is a possible output of SS(w)\mathsf{SS}(w)SS(w).

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_Hamming_Basic
Formal statement
namespace FuzzyExtractors.Hamming

theorem lemma_3_1 {M S : Type} (dis : M → M → ℕ) (t : ℕ)
    (SS : M → PMF S) (Rec : M → S → PMF M) (hcorr : SketchCorrect dis t SS Rec) (lam : ℝ)
    (hrange : ∃ T : Finset S, (T.card : ℝ) ≤ (2 : ℝ) ^ lam ∧ ∀ w, (SS w).support ⊆ (T : Set S)) :
    ∀ m : ℝ, IsAvgSecureSketch dis m (m - lam) t SS Rec := by sorry

end FuzzyExtractors.Hamming
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, arXiv:cs/0602007v4, Lemma 3.1, p. 12
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