Categorical composable cryptography: extended version
From MaRDI portal
(Redirected from Publication:6178713)
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.
Recommendations
Cites work
- (Quantumness in the context of) resource theories
- A mathematical theory of resources
- A proof of the security of quantum key distribution (extended abstract)
- A survey of graphical languages for monoidal categories
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- An equational approach to secure multi-party computation
- An Invitation to Applied Category Theory
- Asynchronous secure computation
- Basic Category Theory
- Bicategorical semantics for nondeterministic computation
- Categorical composable cryptography
- Categorical foundations of gradient-based learning
- Categorical logic of names and abstraction in action calculi
- Categories for Quantum Theory
- Categories for the Practising Physicist
- Chasing diagrams in cryptography
- Compactly accessible categories and quantum key distribution
- Concurrent quantum strategies
- Constructive cryptography -- a new paradigm for security definitions and proofs
- CryptHOL: game-based proofs in higher-order logic
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
- Distributed probabilistic and quantum strategies
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Functorial Boxes in String Diagrams
- GNUC: a new universal composability framework
- Graphical calculus for quantum key distribution (extended abstract)
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 2134022 (Why is no real title available?)
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 692330 (Why is no real title available?)
- scientific article; zbMATH DE number 6765508 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Integrals for Hopf algebras
- Introduction to modern cryptography
- Monoidal Grothendieck construction
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Parallel self-testing of the GHZ state with a proof by diagrams
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- Protocol composition logic (PCL)
- Purity through factorisation
- Resource convertibility and ordered commutative monoids
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Superdense coding with GHZ and quantum key distribution with \(W\) in the \textsc{zx}-calculus
- The IITM model: a simple and expressive model for universal composability
- The reactive simulatability (RSIM) framework for asynchronous systems
- Theory of Cryptography
- Theory of Cryptography
- Toward an algebraic theory of systems
- Tracing the man in the middle in monoidal categories
- Unconditional security in quantum cryptography
- Universal Blind Quantum Computation
- Universally composable quantum multi-party computation
- Universally composable synchronous computation
Cited in
(3)
This page was built for publication: Categorical composable cryptography: extended version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178713)
