Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1 — Construction 5 is an average-case (SDifs(U),m,m−tlog⁡n,t)(\mathrm{SDif}_s(\mathcal U), m, m-t\log n, t)(SDifs​(U),m,m−tlogn,t) secure sketch

Proved
FuzzyExtractors.ImprovedJS.theorem_6_1

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

fuzzy-extractorsinformation-theorymin-entropyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let F\mathcal FF be a finite field with nnn elements, used as the universe U=F\mathcal U=\mathcal FU=F, and let t≤st\le st≤s be natural numbers. Let (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) be the improved Juels–Sudan sketch (Construction 5): SS(w)\mathsf{SS}(w)SS(w) outputs the coefficients of degree s−1s-1s−1 down to s−ts-ts−t of ∏x∈w(z−x)\prod_{x\in w}(z-x)∏x∈w​(z−x), and Rec\mathsf{Rec}Rec decodes by Reed–Solomon decoding and root finding. Then for every real mmm, (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) is an average-case

(SDifs(U), m, m−tlog⁡2n, t)-secure sketch.\big(\mathrm{SDif}_s(\mathcal U),\ m,\ m-t\log_2 n,\ t\big)\text{-secure sketch}.(SDifs​(U), m, m−tlog2​n, t)-secure sketch.

That is:

  1. (correctness) for all sss-element sets w,w′⊆Fw,w'\subseteq\mathcal Fw,w′⊆F with ∣w△w′∣≤t|w\triangle w'|\le t∣w△w′∣≤t, Rec(w′,SS(w))=w\mathsf{Rec}(w',\mathsf{SS}(w))=wRec(w′,SS(w))=w;
  2. (security) for all random variables WWW over sss-element subsets of F\mathcal FF and III (arbitrary auxiliary information) with H~∞(W∣I)≥m\tilde H_\infty(W\mid I)\ge mH~∞​(W∣I)≥m, one has H~∞(W∣(SS(W),I))≥m−tlog⁡2n\tilde H_\infty\big(W\mid(\mathsf{SS}(W),I)\big)\ge m-t\log_2 nH~∞​(W∣(SS(W),I))≥m−tlog2​n.

In particular the entropy loss of the scheme is at most tlog⁡nt\log ntlogn, which §6.2 shows to be essentially optimal for n≫sn\gg sn≫s.

Formalization Note. The paper leaves t≤st\le st≤s implicit; it is a hypothesis here. "nnn is a prime power" is automatic since U\mathcal UU is a finite field. The storage bound ("storage at most tlog⁡nt\log ntlogn") holds by construction, since the sketch is a vector in Ft\mathcal F^tFt, and is not restated. The running-time clause ("SS() and Rec() run in time polynomial in sss, ttt and log⁡n\log nlogn") is dropped: there is no complexity substrate. Logarithms are base 2, H~∞\tilde H_\inftyH~∞​ is in the joint form (see the definition module), and the auxiliary variable III ranges over an arbitrary type.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_ImprovedJS_Basic
Formal statement
namespace FuzzyExtractors.ImprovedJS

/-- Theorem 6.1 (Analysis of Improved JS), p. 22: over a finite field 𝔽 with n elements and for
t ≤ s, Construction 5 is an average-case (SDif_s(𝔽), m, m − t log n, t)-secure sketch, for every m. -/
theorem theorem_6_1 {𝔽 : Type} [Field 𝔽] [Fintype 𝔽] [DecidableEq 𝔽] (s t : ℕ) (hts : t ≤ s)
    (m : ℝ) :
    FuzzyExtractors.Hamming.IsAvgSecureSketch (sdifDist (𝓤 := 𝔽) (s := s)) m
      (m - t * Real.logb 2 (Fintype.card 𝔽)) t (sketch s t) (recover s t) := by sorry

end FuzzyExtractors.ImprovedJS
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Theorem 6.1, p. 22
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