Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.CiphertextIndist
defimported Lean
Ciphertext indistinguishability: the ciphertext distribution is the same for all messages ([KatzLindell2020], Lemma 2.5).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {M K C : Type u} in def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.CiphertextIndist (scheme : EncScheme M K C) : Prop
- Defined in
- CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.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.EncScheme.CiphertextIndist← Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.CiphertextIndist (Cslib/Crypto/Protocols/PerfectSecrecy/Defs.lean:81): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ciphertextDistThe distribution of
Enc_K(m)whenK ← Gen. - 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.EncScheme.ciphertextDistThe distribution of
- Used by 6
- 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.indep_of_ciphertextIndistCiphertext indistinguishability implies message-ciphertext independence.
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 /-- Ciphertext indistinguishability: the ciphertext distribution is the same for all messages ([KatzLindell2020], Lemma 2.5). -/ def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.CiphertextIndist (scheme : EncScheme M K C) : Prop := ∀ m₀ m₁ : M, scheme.ciphertextDist m₀ = scheme.ciphertextDist m₁