The formal analysis of security protocols is a challenging field, with various approaches being studied nowadays. The famous Burrows-Abadi-Needham Logic was the first logical system aiming to validate security protocols. Combining ideas from previous approaches, in this paper we define a complete system of \textit{dynamic epistemic logic} for modeling security protocols. Our logic is implemented, and few of its properties are verifyied, using the theorem prover Lean.
翻译:对安全协议的正式分析是一个具有挑战性的领域,目前正在研究各种方法。 著名的Burrows-Abadi-Needham Locic(Burrows-Abadi-Needham Locic)是第一个旨在验证安全协议的逻辑系统。 本文结合了以前方法中的观点,我们在本文件中定义了一个完整的安全协议模拟系统。 我们的逻辑得到了实施,其属性也很少得到验证,使用理论验证Lean。