AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ofPure

defimported Lean

Build an encryption scheme from deterministic pure encryption/decryption where decryption is a left inverse of encryption for every key.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ofPure.{u} {Message Key Ciphertext : Type u} (gen : PMF Key)
    (enc : Key → Message → Ciphertext) (dec : Key → Ciphertext → Message)
    (h : ∀ key, Function.LeftInverse (dec key) (enc key)) :
    EncScheme Message Key Ciphertext
Defined in
CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ofPure`
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 1
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- Build an encryption scheme from deterministic pure encryption/decryption where decryption is a left inverse of encryption for every key. -/
noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.EncScheme.ofPure.{u} {Message Key Ciphertext : Type u} (gen : PMF Key)
    (enc : Key → Message → Ciphertext) (dec : Key → Ciphertext → Message)
    (h : ∀ key, Function.LeftInverse (dec key) (enc key)) :
    EncScheme Message Key Ciphertext where
  gen := gen
  enc key message := PMF.pure (enc key message)
  dec := dec
  correct key _ message _ hc := by
    rw [PMF.mem_support_pure_iff] at hc; subst hc; exact h key message
See it in the graphDiscuss this resultChallenge it