Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1, linear case — the syndrome sketch is deterministic, n−kn-kn−k symbols long, and average-case secure with loss (n−k)f(n-k)f(n−k)f

Proved
FuzzyExtractors.Hamming.theorem_5_1_linear

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

coding-theorylinear-codesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let F\mathcal FF be a finite field with FFF elements, f=log⁡Ff=\log Ff=logF, and let C⊆FnC\subseteq\mathcal F^nC⊆Fn be a linear code of dimension kkk in which distinct codewords are at Hamming distance at least 2t+12t+12t+1. Let syn:Fn→Fn−k\mathrm{syn}:\mathcal F^n\to\mathcal F^{n-k}syn:Fn→Fn−k be a linear map with kernel CCC. Let (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) be the syndrome construction (Construction 3): SS(w)=syn(w)\mathsf{SS}(w)=\mathrm{syn}(w)SS(w)=syn(w), deterministically, and Rec(w′,s)\mathsf{Rec}(w',s)Rec(w′,s) finds a vector eee of Hamming weight at most ttt with syn(e)=syn(w′)−s\mathrm{syn}(e)=\mathrm{syn}(w')-ssyn(e)=syn(w′)−s and outputs w′−ew'-ew′−e. Then for every mmm,

(SS,Rec) is an average-case (Fn,  m,  m−(n−k)f,  t)-secure sketch,(\mathsf{SS},\mathsf{Rec}) \text{ is an average-case } \big(\mathcal F^n,\; m,\; m-(n-k)f,\; t\big)\text{-secure sketch,}(SS,Rec) is an average-case (Fn,m,m−(n−k)f,t)-secure sketch,

whose output is the (n−k)(n-k)(n−k)-symbol string syn(w)\mathrm{syn}(w)syn(w).

This is the "Furthermore" sentence of Theorem 5.1: for linear codes the sketch can be made deterministic and short.

Formalization Note Determinism and the length n−kn-kn−k are expressed by the construction itself: the sketch is a point mass with values in Fn−k\mathcal F^{n-k}Fn−k. The parity-check matrix is replaced by a linear map with kernel CCC. The efficiency clause is dropped.

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

theorem theorem_5_1_linear {F : Type} [Field F] [Fintype F] [DecidableEq F] {n k t : ℕ}
    (C : Submodule F (Fin n → F)) (hk : Module.finrank F C = k)
    (syn : (Fin n → F) →ₗ[F] (Fin (n - k) → F)) (hsyn : LinearMap.ker syn = C)
    (hdist : ∀ c ∈ C, ∀ c' ∈ C, c ≠ c' → 2 * t + 1 ≤ hammingDist c c') :
    ∀ m : ℝ, IsAvgSecureSketch hammingDist m
      (m - ((n : ℝ) - k) * Real.logb 2 (Fintype.card F)) t
      (syndromeSS syn) (syndromeRec syn t) := 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, Theorem 5.1, p. 17 (second sentence); Construction 3, p. 16
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