Aug 2026
UC, Categorically: Rigorous Diagrammatic Proofs
This work provides a categorical treatment of Canetti's Universal Composability (UC) framework for systems with a static number of parties and sessions, often termed UC for static systems, yielding four benefits, including graphically verified formulation of the composition theorem.
P. Farshim, M. Karvonen, Andre Knispel et al.
· IACR Cryptology ePrint Archi... · 0 citations