范畴化可组合密码学：扩展版
Categorical composable cryptography: extended version
AI总结：
本文用范畴论形式化密码学模拟范式，构建可组合安全的抽象模型，并用弦图重新推导一次性密码本安全性、Diffie-Hellman正确性及二分三方密码学的不可能结果。
摘要：
我们以范畴论形式化密码学的模拟范式，并证明对抽象攻击安全的协议构成一个对称幺半范畴，从而给出密码学中可组合安全定义的抽象模型。我们的模型能够以模块化、灵活的方式纳入计算安全性、设置假设以及各种攻击模型，例如共谋或独立行动的敌手子集。最后，我们使用弦图重新推导了一次性密码本的安全性、Diffie-Hellman密钥交换的正确性，以及关于二分和三方密码学极限的不可能结果，例如排除了可组合承诺和广播。在此过程中，我们展示了两个可能具有独立意义的资源理论范畴构造：一个刻画多方共享的资源，另一个刻画渐近成功的资源转换。本文是2023年12月18日首次发布的论文arXiv:2208.13232的修正版本。
英文摘要：
We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive the security of the one-time pad, correctness of Diffie-Hellman key exchange and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting. On the way, we exhibit two categorical constructions of resource theories that might be of independent interest: one capturing resources shared among multiple parties and one capturing resource conversions that succeed asymptotically. This is a corrected version of the paper arXiv:2208.13232 published originally on December 18, 2023.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
