We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive the security of the one-time pad and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting.
CITATION STYLE
Broadbent, A., & Karvonen, M. (2022). Categorical composable cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13242 LNCS, pp. 161–183). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-99253-8_9
Mendeley helps you to discover research relevant for your work.