I wonder if you could recast cryptography in categorical language:

Instead of “groups, rings and fields + probabilistic Turing machines”, you work with objects that stand for resources (channels, keys, random beacons, OT-boxes, etc.) and morphisms that stand for protocols transforming those resources.

Tricks with polynomials and Riemann-Roch spaces. Breaking into the platonic realm to pillage forbidden abstractions. Starknet grantee.

I still believe category theory is the best framework we have to reason about things in general. I'm not a cryptographer but this feels more intuitive than the current Universal-Composability model or game-based proofs and sequences of games frameworks for reasoning about cryptographic security.