An Epistemic Foundation for Authentication Logics (Extended Abstract)

Joseph Y. Halpern, R. V. D. Meyden, Riccardo Pucella
{"title":"An Epistemic Foundation for Authentication Logics (Extended Abstract)","authors":"Joseph Y. Halpern, R. V. D. Meyden, Riccardo Pucella","doi":"10.4204/EPTCS.251.21","DOIUrl":null,"url":null,"abstract":"While there have been many attempts, going back to BAN logic, to base reasoning about security protocols on epistemic notions, they have not been all that successful. Arguably, this has been due to the particular logics chosen. We present a simple logic based on the well-understood modal operators of knowledge, time, and probability, and show that it is able to handle issues that have often been swept under the rug by other approaches, while being flexible enough to capture all the higher- level security notions that appear in BAN logic. Moreover, while still assuming that the knowledge operator allows for unbounded computation, it can handle the fact that a computationally bounded agent cannot decrypt messages in a natural way, by distinguishing strings and message terms. We demonstrate that our logic can capture BAN logic notions by providing a translation of the BAN operators into our logic, capturing belief by a form of probabilistic knowledge.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Aspects of Rationality and Knowledge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.251.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

While there have been many attempts, going back to BAN logic, to base reasoning about security protocols on epistemic notions, they have not been all that successful. Arguably, this has been due to the particular logics chosen. We present a simple logic based on the well-understood modal operators of knowledge, time, and probability, and show that it is able to handle issues that have often been swept under the rug by other approaches, while being flexible enough to capture all the higher- level security notions that appear in BAN logic. Moreover, while still assuming that the knowledge operator allows for unbounded computation, it can handle the fact that a computationally bounded agent cannot decrypt messages in a natural way, by distinguishing strings and message terms. We demonstrate that our logic can capture BAN logic notions by providing a translation of the BAN operators into our logic, capturing belief by a form of probabilistic knowledge.
认证逻辑的认识论基础(扩展摘要)
虽然已经有很多尝试,回到BAN逻辑,将安全协议的推理建立在认识论概念的基础上,但他们并没有那么成功。可以说,这是由于所选择的特定逻辑。我们提出了一个简单的逻辑,该逻辑基于众所周知的知识、时间和概率的模态运算符,并表明它能够处理经常被其他方法掩盖的问题,同时足够灵活地捕获BAN逻辑中出现的所有更高级别的安全概念。此外,虽然仍然假设知识运算符允许无界计算,但它可以处理计算有界代理不能通过区分字符串和消息术语以自然方式解密消息的事实。我们证明了我们的逻辑可以通过提供BAN运算符到我们的逻辑的翻译来捕获BAN逻辑概念,通过概率知识的形式捕获信念。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信