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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Categorical composable cryptography

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9222.57535047 kWh Sinyi Seminar Room, Cambridge Judge Business School Regional Zebrafish meeting

Other talks

Quantifying the unquantifiable? Assessing the importance of almsgiving in early modern France and Spain Title to be confirmed The search for a new population of strong gravitational lenses with JWST Tea and Coffee Break Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Title to be confirmed
 

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