University of Cambridge > Talks.cam > Category Theory Seminar > Categorical composable cryptography

Categorical composable cryptography

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact José Siqueira.

We formalize the simulation paradigm of cryptography in terms of category theory, resulting in an abstract model of composable security definitions. We begin by recalling some background on cryptography and (categorical) resource theories. After this, we explain the framework itself, defined in terms of abstract attack model on a symmetric monoidal category, and show that protocols secure against attacks form a symmetric monoidal category. We then use string diagrams to rederive no-go results concerning the limits of bipartite, ruling out e.g. composable commitments. Time permitting, we discuss extensions of the framework that allow us to incorporate computational security and set-up assumptions into the model.

Zoom link: https://maths-cam-ac-uk.zoom.us/j/93780911329?pwd=SFlJWEZud05lRTlGR1RkVVNjWGxEZz09

This talk is part of the Category Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity