Categorical composable cryptography: extended version

Abstract

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive the security of the one-time pad, correctness of Diffie-Hellman key exchange and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting. On the way, we exhibit two categorical constructions of resource theories that might be of independent interest: one capturing resources shared among multiple parties and one capturing resource conversions that succeed asymptotically. This is a corrected version of the paper arXiv:2208.13232 published originally on December 18, 2023.

Extended version of arXiv:2105.05949 which appeared in FoSSaCS 2022

References in corpus (19)

• Quantum cryptography: Public key distribution and coin tossing
• Quantum Resource Theories
• Tight Finite-Key Analysis for Quantum Cryptography
• Universal blind quantum computation
• Probabilistic theories with purification
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• A survey of graphical languages for monoidal categories
• A mathematical theory of resources
• (Quantumness in the context of) Resource Theories
• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Locking of accessible information and implications for the security of quantum cryptography
• Cryptographic security of quantum key distribution
• Monoidal Grothendieck construction
• A comonadic view of simulation and quantum resources
• Parallel Self-Testing of the GHZ State with a Proof by Diagrams
• Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus
• Toward an Algebraic Theory of Systems
• Categorical composable cryptography
• Picture-perfect Quantum Key Distribution

Cited by in corpus (2)

• Why cut-and-choose quantum state verification cannot be both efficient and secure
• Security proofs for practical QKD: variations, techniques, gaps, and limitations