Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndist
theoremverifiedformalizationimported Lean
Ciphertext indistinguishability implies perfect secrecy.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open PMF ENNReal in universe u in variable {M K C : Type u} in theorem Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndist (scheme : EncScheme M K C) (h : scheme.CiphertextIndist) : scheme.PerfectlySecret
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndist`
- 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.perfectlySecret_of_ciphertextIndist← Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndist (Cslib/Crypto/Protocols/PerfectSecrecy/Internal/PerfectSecrecy.lean:80): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.marginalCiphertextDistMarginal ciphertext distribution given a message prior.
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.CiphertextIndistCiphertext indistinguishability: the ciphertext distribution is the same for all messages ([KatzLindell2020], Lemma 2.5).
- Cslib.Crypto.Protocols.PerfectSecrecy.EncSchemeA private-key encryption scheme over message space
M, key spaceK, and ciphertext spaceC([KatzLindell2020], Definition 2.1). - 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.jointDistJoint distribution of
(M, C)given a message prior. - Cslib.Crypto.Protocols.PerfectSecrecy.indep_of_ciphertextIndistCiphertext indistinguishability implies message-ciphertext independence.
- Cslib.Probability.PMF.posteriorDist_applyCslib.Probability.PMF.posteriorDist_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…
- Used by 1
- 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).
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open PMF ENNReal in universe u in variable {M K C : Type u} in /-- Ciphertext indistinguishability implies perfect secrecy. -/ theorem Cslib.Crypto.Protocols.PerfectSecrecy.perfectlySecret_of_ciphertextIndist (scheme : EncScheme M K C) (h : scheme.CiphertextIndist) : scheme.PerfectlySecret := (perfectlySecret_iff_indep scheme).mpr (fun msgDist m c => indep_of_ciphertextIndist scheme h msgDist m c)