Categorical composable cryptography

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

• Martti Karvonen (University of Ottawa)
• Tuesday 25 May 2021, 16:15-17:15
• Zoom (Meeting ID 937 8091 1329, passcode 001582).

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Category Theory Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• School of Physical Sciences
• Zoom (Meeting ID 937 8091 1329, passcode 001582)
• bld31
• ndb35's list
• yk373's list

Note that ex-directory lists are not shown.