Cryptography Categories

by Ilinca Radulescu

Monday May 19, 2025, 10:30 AM → 11:30 AM Europe/Paris

435 (ENS Lyon)

We introduce a novel framework for constructing cryptographic schemes in the setting of category theory. Simply put, a category is defined as a set of objects and a set of morphisms, which obtain a list of specific properties. Since we are interested in obtaining a cryptographic category, we also introduce a list of computational axioms that the framework must satisfy. A key concept is the fingerprint, a collection of maps from the homset to a set $\mathcal{M}$, with some special properties. Using this framework, we then show how to build a hash function, a signature scheme and a Chameleon-Hash function.