Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret
defimported Lean
An encryption scheme is perfectly secret if the posterior message distribution equals the prior for every ciphertext with positive probability ([KatzLindell2020], Definition 2.3).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {M K C : Type u} in noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret (scheme : EncScheme M K C) : Prop
- Defined in
- CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret`
- Lean proof
- By Samuel Schlesinger, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret← Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret (Cslib/Crypto/Protocols/PerfectSecrecy/Defs.lean:74): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.marginalCiphertextDistMarginal ciphertext distribution given a message prior.
- Cslib.Crypto.Protocols.PerfectSecrecy.EncSchemeA private-key encryption scheme over message space
M, key spaceK, and ciphertext spaceC([KatzLindell2020], Definition 2.1). - Cslib.Probability.PMF.posteriorDist_applyCslib.Probability.PMF.posteriorDist_apply
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDistThe posterior message distribution
Pr[M | C = c]as a probability distribution, given a message prior and a ciphertext in the support of…
- Used by 7
- Cslib.Crypto.Protocols.PerfectSecrecy.ciphertextIndist_of_perfectlySecretPerfect secrecy implies ciphertext indistinguishability.
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.perfectlySecret_iff_ciphertextIndistA scheme is perfectly secret iff the ciphertext distribution is independent of the plaintext ([KatzLindell2020], Lemma 2.5).
- Cslib.Crypto.Protocols.PerfectSecrecy.otp_perfectlySecretThe one-time pad is perfectly secret ([KatzLindell2020], Theorem 2.10).
- Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndistCiphertext indistinguishability implies perfect secrecy.
- Cslib.Crypto.Protocols.PerfectSecrecy.shannonKeySpacePerfect secrecy requires
|K| ≥ |M|(Shannon's theorem). - Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_iff_indepPerfect secrecy is equivalent to message-ciphertext independence. The two formulations are related by multiplying/dividing by
marginal(c). - Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.perfectlySecret_keySpace_gePerfect secrecy requires
|K| ≥ |M|([KatzLindell2020], Theorem 2.12).
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {M K C : Type u} in /-- An encryption scheme is perfectly secret if the posterior message distribution equals the prior for every ciphertext with positive probability ([KatzLindell2020], Definition 2.3). -/ noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecret (scheme : EncScheme M K C) : Prop := ∀ (msgDist : PMF M) (c : C) (hc : c ∈ (scheme.marginalCiphertextDist msgDist).support), scheme.posteriorMsgDist msgDist c hc = msgDist