Categorical composable cryptography

DOI10.1007/978-3-030-99253-8_9arXiv2105.05949OpenAlexW3163835182MaRDI QIDQ6181927

Anne Broadbent, Martti Karvonen

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.05949

zbMATH Keywords

cryptographycategory theoryquantum cryptographycomposable security

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Categorical composable cryptography: extended version

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicategorical semantics for nondeterministic computation
• Distributed probabilistic and quantum strategies
• Secure protocol composition
• A mathematical theory of resources
• Quantum cryptography: public key distribution and coin tossing
• Probabilistic encryption
• Toward an algebraic theory of systems
• 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
• 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
• An equational approach to secure multi-party computation
• 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
• Compactly accessible categories and quantum key distribution
• Categorical logic of names and abstraction in action calculi
• Universally Composable Synchronous Computation
• Universal Blind Quantum Computation
• Concurrent Quantum Strategies
• Asynchronous secure computation
• Resource convertibility and ordered commutative monoids
• Chasing Diagrams in Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Categorical foundations of gradient-based learning

This page was built for publication: Categorical composable cryptography