Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDist
defimported Lean
The posterior message distribution Pr[M | C = c] as a probability distribution, given a message prior and a ciphertext in the support of the marginal distribution.
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.posteriorMsgDist (scheme : EncScheme M K C) (msgDist : PMF M) (c : C) (hc : c ∈ (scheme.marginalCiphertextDist msgDist).support) : PMF M
- Defined in
- CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDist`
- 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.posteriorMsgDist← Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDist (Cslib/Crypto/Protocols/PerfectSecrecy/Defs.lean:58): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ciphertextDistThe distribution of
Enc_K(m)whenK ← Gen. - 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.Probability.PMF.posteriorDistThe posterior distribution
Pr[A = a | B = b]as aPMF, givena ← p,b ← f a, and thatbhas positive marginal probability.
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ciphertextDistThe distribution of
- Used by 3
- 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.posteriorMsgDist_applyCslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDist_apply
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.PerfectlySecretAn encryption scheme is perfectly secret if the posterior message distribution equals the prior for every ciphertext with positive…
- Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_iff_indepPerfect secrecy is equivalent to message-ciphertext independence. The two formulations are related by multiplying/dividing by
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 /-- The posterior message distribution `Pr[M | C = c]` as a probability distribution, given a message prior and a ciphertext in the support of the marginal distribution. -/ noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.posteriorMsgDist (scheme : EncScheme M K C) (msgDist : PMF M) (c : C) (hc : c ∈ (scheme.marginalCiphertextDist msgDist).support) : PMF M := Cslib.Probability.PMF.posteriorDist msgDist scheme.ciphertextDist c hc