arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.05840cs.CRmath.CT
收藏

加密通信中信息流的图解法(扩展版)

A diagrammatic approach to information flow in encrypted communication (extended version)

Peter Hines

摘要:

我们给出了图解工具来推理加密通信中的信息流。特别是,我们感兴趣的是推断信息流(通信或其他)发生的地方,并充分考虑所有可能的路径。核心的数学概念是使用一个单一的分类图来模拟底层的数学,参与者的认知知识,以及(隐含的)参与者之间的潜在或实际的沟通。其中一个关键部分是“正确性”或“一致性”标准,确保我们准确和充分地考虑到信息可能被知晓的不同途径(即通信和/或计算)。我们演示了如何应用这种形式主义来回答有关通信场景的问题,在这些场景中,我们有关于参与者及其交互的部分信息。同样,我们将展示如何分析协议或通信变化的后果,并列举事件可能发生的不同顺序。我们使用各种形式的Diffie-Hellman密钥交换作为这些技术的说明。然而,它们是完全通用的;我们在附录中说明了如何以同样的方式分析来自非交换密码学的其他协议。

英文摘要:

We give diagrammatic tools to reason about information flow within encrypted communication. In particular, we are interested in deducing where information flow (communication or otherwise) has taken place, and fully accounting for all possible paths. The core mathematical concept is using a single categorical diagram to model the underlying mathematics, the epistemic knowledge of the participants, and (implicitly) the potential or actual communication between participants. A key part of this is a `correctness' or `consistency' criterion that ensures we accurately & fully account for the distinct routes by which information may come to be known (i.e. communication and / or calculation). We demonstrate how this formalism may be applied to answer questions about communication scenarios where we have the partial information about the participants and their interactions. Similarly, we show how to analyse the consequences of changes to protocols or communications, and to enumerate the distinct orders in which events may have occurred. We use various forms of Diffie-Hellman key exchange as an illustration of these techniques. However, they are entirely general; we illustrate in an appendix how other protocols from non-commutative cryptography may be analysed in the same manner.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑