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 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’.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Choo, K.-K.R., Boyd, C., Hitchcock, Y.: Errors in computational complexity proofs for protocols. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 624–643. Springer, Heidelberg (2005)
Dent, A.W.: Fundamental problems in provable security and cryptography. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 364(1849), 3215–3230 (2006)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)
Dolev, D., Even, S., Karp, R.M.: On the security of ping-pong protocols. In: CRYPTO, pp. 177–186 (1982)
Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)
Pavlovic, D.: Geometry of abstraction in quantum computation. Proceedings of Symposia in Applied Mathematics 71, 233–267 (2012) arxiv.org:1006.1010
Freyd, P.: Abelian Categories: An Introduction to the Theory of Functors. Harper and Row (1964)
Goldreich, O.: Foundations of Cryptography. Cambridge University Press (2000)
Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC 1982: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 365–377. ACM Press, New York (1982)
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
Grillet, P.A.: Semigroups: An introduction to the structure theory. Marcel Dekker, Inc. (1995)
Joyal, A., Street, R.: The geometry of tensor calculus I. Adv. in Math. 88, 55–113 (1991)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC Series in Cryptography and Network Security. Chapman & Hall/CRC (2007)
Kelly, G.M.: On clubs and doctrines. In: Kelly, G.M. (ed.) Category Seminar. Sydney 1972/73, pp. 181–256. Springer, Berlin (1974)
Koblitz, N., Menezes, A.: Another look at “Provable Security”. II. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 148–175. Springer, Heidelberg (2006)
Koblitz, N., Menezes, A.: Another look at “Provable Security”. J. Cryptology 20(1), 3–37 (2007)
Koblitz, N., Menezes, A.: The brave new world of bodacious assumptions in cryptography. Notices of the American Mathematical Society 57(3), 357–365 (2010)
Lambek, J.: How to program an infinite abacus. Canad. Math. Bull. 4(3), 295–302 (1961)
Lambek, J.: Lectures on Rings and Modules. Blaisdell Publishing Co. (1966)
Lambek, J.: From types to sets. Adv. in Math. 36, 113–164 (1980)
Lambek, J., Scott, P.J.: Introduction to higher order categorical logic. Cambridge Stud. Adv. Math., vol. 7. Cambridge University Press, New York (1986)
Lane, S.M.: Homology. Springer (1963)
Pavlovic, D.: Maps II: Chasing diagrams in categorical proof theory. J. of the IGPL 4(2), 1–36 (1996)
Pavlovic, D.: Categorical logic of names and abstraction in action calculus. Math. Structures in Comp. Sci. 7, 619–637 (1997)
Pavlovic, D.: Monoidal computer I: Basic computability by string diagrams. Information and Computation (2013) (to appear) arxiv:1208.5205
Pavlovic, D., Meadows, C.: Bayesian authentication: Quantifying security of the Hancke-Kuhn protocol. E. Notes in Theor. Comp. Sci. 265, 97–122 (2010)
Pavlovic, D., Pratt, V.: The continuum as a final coalgebra. Theor. Comp. Sci. 280(1-2), 105–122 (2002)
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)
Shannon, C.E.: Communication theory of secrecy systems. Bell Systems Technical Journal 28, 656–715 (1949)
Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 239–259. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pavlovic, D. (2014). Chasing Diagrams in Cryptography. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds) Categories and Types in Logic, Language, and Physics. Lecture Notes in Computer Science, vol 8222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54789-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-54789-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54788-1
Online ISBN: 978-3-642-54789-8
eBook Packages: Computer ScienceComputer Science (R0)