论文标题
分类合并密码学：扩展版本
Categorical composable cryptography: extended version
论文作者
论文摘要
我们以类别理论的形式将密码学的仿真范式形式化，并表明协议免受抽象攻击形成对称的单体类别，从而为加密术中的合并安全性定义提供了抽象的模型。我们的模型能够以模块化，灵活的方式结合计算安全性，设置假设和各种攻击模型，例如勾结或独立代表对手子集。最后，我们使用字符串图来重新设计一次性垫的安全性，Diffie-Hellman密钥交换的正确性以及有关双方和三方加密术的限制的No-Go结果，例如，排除了合成的承诺和广播。在途中，我们展示了可能具有独立感兴趣的资源理论的两个分类结构：一个捕获多个政党共享的资源，一个捕获渐近成功的资源转换。 这是本文Arxiv的校正版本：2208.13232最初于2023年12月18日发布。
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.
