Chasing Diagrams in Cryptography
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 sometime 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 diagram chasing, going back to Lambek’s seminal ‘Lecture Notes on Rings and Modules’.
KeywordsBoolean Function Category Theory Hiding Condition Security Parameter Follow Diagram Commute
Unable to display preview. Download preview PDF.
- 4.Dolev, D., Even, S., Karp, R.M.: On the security of ping-pong protocols. In: CRYPTO, pp. 177–186 (1982)Google Scholar
- 6.Pavlovic, D.: Geometry of abstraction in quantum computation. Proceedings of Symposia in Applied Mathematics 71, 233–267 (2012) arxiv.org:1006.1010Google Scholar
- 7.Freyd, P.: Abelian Categories: An Introduction to the Theory of Functors. Harper and Row (1964)Google Scholar
- 8.Goldreich, O.: Foundations of Cryptography. Cambridge University Press (2000)Google Scholar
- 11.Grillet, P.A.: Semigroups: An introduction to the structure theory. Marcel Dekker, Inc. (1995)Google Scholar
- 13.Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC Series in Cryptography and Network Security. Chapman & Hall/CRC (2007)Google Scholar
- 19.Lambek, J.: Lectures on Rings and Modules. Blaisdell Publishing Co. (1966)Google Scholar
- 22.Lane, S.M.: Homology. Springer (1963)Google Scholar
- 25.Pavlovic, D.: Monoidal computer I: Basic computability by string diagrams. Information and Computation (2013) (to appear) arxiv:1208.5205Google Scholar
- 28.Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)Google Scholar