AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Built on 4
Used by 7

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
See it in the graphDiscuss this resultChallenge it