Ciphertext Indist of perfectly Secret
Cslib.Crypto.Protocols.PerfectSecrecy.ciphertextIndist_of_perfectlySecret
Plain-language statement
Perfect secrecy implies ciphertext indistinguishability.
Exact Lean statement
theorem ciphertextIndist_of_perfectlySecret (scheme : EncScheme M K C)
(h : scheme.PerfectlySecret) :
scheme.CiphertextIndistFormal artifact
Lean source
theorem ciphertextIndist_of_perfectlySecret (scheme : EncScheme M K C) (h : scheme.PerfectlySecret) : scheme.CiphertextIndist := by classical rw [perfectlySecret_iff_indep] at h intro m₀ m₁; ext c have hs : ({m₀, m₁} : Finset M).Nonempty := ⟨m₀, Finset.mem_insert_self ..⟩ set μ := PMF.uniformOfFinset _ hs suffices key : ∀ m ∈ ({m₀, m₁} : Finset M), scheme.ciphertextDist m c = scheme.marginalCiphertextDist μ c by exact (key m₀ (by simp)).trans (key m₁ (by simp)).symm intro m hm have hne := (PMF.mem_support_uniformOfFinset_iff hs m).mpr hm have hne_top := ne_top_of_le_ne_top one_ne_top (PMF.coe_le_one μ m) exact (ENNReal.mul_right_inj hne hne_top).mp (by rw [← jointDist_eq]; exact h μ m c)- Project
- Lean Computer Science Library
- License
- Apache-2.0
- Commit
- f36649cff2c9
- Source
- Cslib/Crypto/Protocols/PerfectSecrecy/Internal/PerfectSecrecy.lean:87-101
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.