Chasing Diagrams in Cryptography

DOI10.1007/978-3-642-54789-8_19zbMath1286.94081arXiv1401.6488OpenAlexW4299151336MaRDI QIDQ5414973

Dusko Pavlovic

Publication date: 8 May 2014

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Categories of spans/cospans, relations, or partial maps (18B10)

Related Items

On one-way ring homomorphisms ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoidal computer. I: Basic computability by string diagrams
• Another look at ``provable security
• Probabilistic encryption
• From types to sets
• The geometry of tensor calculus. I
• The continuum as a final coalgebra
• Geometry of abstraction in quantum computation
• Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
• On the security of ping-pong protocols
• Communication Theory of Secrecy Systems*
• How to Program an Infinite Abacus
• New directions in cryptography
• On the security of public key protocols
• Categorical logic of names and abstraction in action calculi
• Fundamental problems in provable security and cryptography
• Errors in Computational Complexity Proofs for Protocols
• Another Look at “Provable Security”. II