Categorical composable cryptography
arXiv:2105.05949 · doi:10.1007/978-3-030-99253-8_9
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 and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting.
arXiv commentUpdated to match the proceedings version
References in corpus (29)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Quantum Resource Theories
- Tight Finite-Key Analysis for Quantum Cryptography
- Is Quantum Bit Commitment Really Possible?
- 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
- Locking of accessible information and implications for the security of quantum cryptography
- Universally Composable Quantum Multi-Party Computation
- Composability in quantum cryptography
- The Trouble with Quantum Bit Commitment
- Resource convertibility and ordered commutative monoids
- Cryptographic security of quantum key distribution
- Causal Boxes: Quantum Information-Processing Systems Closed under Composition
- Monoidal Grothendieck construction
- Environment and classical channels in categorical quantum mechanics
- 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
- Chasing diagrams in cryptography
- Toward an Algebraic Theory of Systems
- Compactly accessible categories and quantum key distribution
- Purity through Factorisation
- Compositional Deep Learning
- Picture-perfect Quantum Key Distribution
- Graphical Methods in Device-Independent Quantum Cryptography