Categorical composable cryptography: extended version
From MaRDI portal
Publication:6178713
DOI10.46298/lmcs-19(4:30)2023arXiv2208.13232OpenAlexW4389935239MaRDI QIDQ6178713
Martti Karvonen, Anne Broadbent
Publication date: 16 January 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.13232
Cites Work
- Bicategorical semantics for nondeterministic computation
- Distributed probabilistic and quantum strategies
- A mathematical theory of resources
- Toward an algebraic theory of systems
- CryptHOL: game-based proofs in higher-order logic
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- The IITM model: a simple and expressive model for universal composability
- Everything you always wanted to know about LOCC (but were afraid to ask)
- The reactive simulatability (RSIM) framework for asynchronous systems
- GNUC: a new universal composability framework
- Integrals for Hopf algebras
- Graphical Calculus for Quantum Key Distribution (Extended Abstract)
- Protocol Composition Logic (PCL)
- (QUANTUMNESS IN THE CONTEXT OF) RESOURCE THEORIES
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- Tracing the Man in the Middle in Monoidal Categories
- Picturing Quantum Processes
- An equational approach to secure multi-party computation
- Categories for the Practising Physicist
- A Survey of Graphical Languages for Monoidal Categories
- A proof of the security of quantum key distribution (extended abstract)
- Unconditional security in quantum cryptography
- Monoidal Grothendieck construction
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Universally Composable Quantum Multi-party Computation
- Environment and Classical Channels in Categorical Quantum Mechanics
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Functorial Boxes in String Diagrams
- Compactly accessible categories and quantum key distribution
- Categorical logic of names and abstraction in action calculi
- Universally Composable Synchronous Computation
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- Basic Category Theory
- Universal Blind Quantum Computation
- Categories for Quantum Theory
- Concurrent Quantum Strategies
- Asynchronous secure computation
- Resource convertibility and ordered commutative monoids
- An Invitation to Applied Category Theory
- Chasing Diagrams in Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Categorical foundations of gradient-based learning
- Categorical composable cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Categorical composable cryptography: extended version
