Metraipolis › archive › dc_2445c51e57ea

UC, Categorically: Rigorous Diagrammatic Proofs — arXiv:2608.04521

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04521
License (as archived)
CC0-1.0
Archived
2026-10-31T11:27:37.047Z
SHA-256 of the archived text
7ead08274d8fa95b00cfdffcbb369a133617480eb4d36ebfcfea2a918a5dcf69
Stable URL of this page
https://metraipolis.com/documento/dc_2445c51e57ea

How to cite

UC, Categorically: Rigorous Diagrammatic Proofs — arXiv:2608.04521 — arXiv (en), https://arxiv.org/abs/2608.04521 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2445c51e57ea (Metraipolis archive dc_2445c51e57ea, sha256 7ead08274d8fa95b00cfdffcbb369a133617480eb4d36ebfcfea2a918a5dcf69)
BibTeX
@misc{dc2445c51e57ea,
  title = {UC, Categorically: Rigorous Diagrammatic Proofs — arXiv:2608.04521},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04521},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2445c51e57ea; sha256 7ead08274d8fa95b00cfdffcbb369a133617480eb4d36ebfcfea2a918a5dcf69},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04521. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Category theory is a mathematical theory of composition, widely used in logic, computing, and physics. Here we apply it to give a theory of secure composition. In particular, we provide 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. First, we present our results graphically yet retain rigor by applying a standard categorical technique known as string diagrams. In particular, our formulation of the composition theorem can be graphically verified with a short sequence of diagrams, while remaining translatable to equations and amenable to formal verification. Second, categories let us generalize so that our results extend beyond interactive Turing machines to other forms of computation, such as quantum computation or domain-specific languages. Third, categories help us drop some unnecessary restrictions of UC (e.g., our adversary can be a computational network rather than a single Turing machine); we prove equivalence between our variant and the usual UC, showing no expressiveness is lost. Finally, the categorical perspective leads us to identify and correct some minor technical oversights in the standard formulation of simple UC.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-06 in cs.CR).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Cryptography and Security (cs.CR); Category Theory (math.CT).
Pagina del lavoro: https://arxiv.org/abs/2608.04521 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:17:19.460Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).