Chasing diagrams in cryptography

DOI10.1007/978-3-642-54789-8_19MaRDI QIDQ5414973zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: Cryptography is a theory of secret functions. Category theory is a general theory of functions. Cryptography has reached a stage where its structures often take several pages to define, and its formulas sometimes run from page to page. Category theory has some complicated definitions as well, but one of its specialties is taming the flood of structure. Cryptography seems to be in need of high level methods, whereas category theory always needs concrete applications. So why is there no categorical cryptography? One reason may be that the foundations of modern cryptography are built from probabilistic polynomial-time Turing machines, and category theory does not have a good handle on such things. On the other hand, such foundational problems might be the very reason why cryptographic constructions often resemble low level machine programming. I present some preliminary explorations towards categorical cryptography. It turns out that some of the main security concepts are easily characterized through the categorical technique of *diagram chasing*, which was first used Lambek's seminal `Lecture Notes on Rings and Modules'.

Recommendations

• Constructive cryptography -- a primer. (Abstract)
• Categorical interpretations of some key agreement protocols
• Constructive cryptography -- a new paradigm for security definitions and proofs
• Cryptographic logical relations
• scientific article; zbMATH DE number 1164029

Cites work

• Another look at ``provable security
• Another Look at “Provable Security”. II
• Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
• Categorical logic of names and abstraction in action calculi
• Communication Theory of Secrecy Systems*
• Errors in Computational Complexity Proofs for Protocols
• From types to sets
• Fundamental problems in provable security and cryptography
• Geometry of abstraction in quantum computation
• How to Program an Infinite Abacus
• scientific article; zbMATH DE number 5081837 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• scientific article; zbMATH DE number 1842495 (Why is no real title available?)
• scientific article; zbMATH DE number 774488 (Why is no real title available?)
• scientific article; zbMATH DE number 3231118 (Why is no real title available?)
• scientific article; zbMATH DE number 3195417 (Why is no real title available?)
• Monoidal computer. I: Basic computability by string diagrams
• New directions in cryptography
• On the security of ping-pong protocols
• On the security of public key protocols
• Probabilistic encryption
• The brave new world of bodacious assumptions in cryptography
• The continuum as a final coalgebra
• The geometry of tensor calculus. I

Cited in

(6)

• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• scientific article; zbMATH DE number 7300652 (Why is no real title available?)
• On one-way ring homomorphisms
• Categorical composable cryptography: extended version
• Categorical composable cryptography
• A categorical approach to DIBI models

This page was built for publication: Chasing diagrams in cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414973)