View indist of tail Sampler
Cslib.Crypto.Protocols.SecretSharing.Shamir.view_indist_of_tailSampler
Plain-language statement
Translation-invariant Shamir tail samplers induce secret-independent views for unauthorized coalitions.
Exact Lean statement
theorem view_indist_of_tailSampler (params : Params F Party)
(sampler : TailSampler params) :
∀ (s : Finset Party), ¬ authorized params s → ∀ secret₀ secret₁ : F,
viewDistOf sampler.gen (share params) s secret₀ =
viewDistOf sampler.gen (share params) s secret₁Formal artifact
Lean source
theorem view_indist_of_tailSampler (params : Params F Party) (sampler : TailSampler params) : ∀ (s : Finset Party), ¬ authorized params s → ∀ secret₀ secret₁ : F, viewDistOf sampler.gen (share params) s secret₀ = viewDistOf sampler.gen (share params) s secret₁ := by intro s hs secret₀ secret₁ have hcard : s.card ≤ params.threshold := by have hs' : ¬ params.threshold + 1 ≤ s.card := by simpa [authorized] using hs exact Nat.lt_succ_iff.mp (Nat.not_le.mp hs') unfold viewDistOf calc PMF.map (fun coeffs : Randomness params => (fun i : s => share params coeffs secret₀ i : s → F)) sampler.gen = PMF.map (fun coeffs : Randomness params => (fun i : s => share params (coeffs + privacyCorrection (F := F) params s hcard secret₀ secret₁) secret₁ i : s → F)) sampler.gen := by congr 1 funext coeffs exact view_eq_view_add_privacyCorrection (F := F) params s hcard secret₀ secret₁ coeffs _ = PMF.map (fun coeffs : Randomness params => (fun i : s => share params coeffs secret₁ i : s → F)) (PMF.map (fun coeffs => coeffs + privacyCorrection (F := F) params s hcard secret₀ secret₁) sampler.gen) := by rw [PMF.map_comp] rfl _ = PMF.map (fun coeffs : Randomness params => (fun i : s => share params coeffs secret₁ i : s → F)) sampler.gen := by rw [sampler.map_add_eq_self]- Project
- Lean Computer Science Library
- License
- Apache-2.0
- Commit
- f36649cff2c9
- Source
- Cslib/Crypto/Protocols/SecretSharing/Shamir.lean:216-248
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Unique minimal
Cslib.Automata.DA.FinAcc.unique_minimal
Plain-language statement
The minimal DFA M accepting the language l is unique up to unique isomorphism.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family cover
Cslib.Automata.NA.Buchi.buchiFamily_cover
Project documentation
na.buchiFamily is a cover if na has only finitely many states. This theorem uses the Ramsey theorem for infinite graphs and does not depend on any details of na.BuchiCongruence other than that it is of finite index.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family saturation
Cslib.Automata.NA.Buchi.buchiFamily_saturation
Plain-language statement
na.buchiFamily saturates the ω-language accepted by na.
Source project: Lean Computer Science Library
Person-level attribution pending.