Protocol Composition Logic

Anupam Datta, John C. Mitchell, Arnab Roy, Stephan Hyeonjun Stiller
{"title":"Protocol Composition Logic","authors":"Anupam Datta, John C. Mitchell, Arnab Roy, Stephan Hyeonjun Stiller","doi":"10.3233/978-1-60750-714-7-182","DOIUrl":null,"url":null,"abstract":"Protocol Composition Logic (PCL) is a logic for proving authentication and secrecy properties of network protocols. This chapter presents the central concepts of PCL, including a protocol programming language, the semantics of protocol execution in the presence of a network attacker, the syntax and semantics of PCL assertions, and axioms and proof rules for proving authentication properties. The presentation draws on a logical framework enhanced with subtyping, setting the stage for mechanizing PCL proofs. and gives a new presentation of PCL semantics involving honest and unconstrained principals. Other papers on PCL provide additional axioms, proof rules, and case studies of standardized protocols in","PeriodicalId":253475,"journal":{"name":"Formal Models and Techniques for Analyzing Security Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formal Models and Techniques for Analyzing Security Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-60750-714-7-182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Protocol Composition Logic (PCL) is a logic for proving authentication and secrecy properties of network protocols. This chapter presents the central concepts of PCL, including a protocol programming language, the semantics of protocol execution in the presence of a network attacker, the syntax and semantics of PCL assertions, and axioms and proof rules for proving authentication properties. The presentation draws on a logical framework enhanced with subtyping, setting the stage for mechanizing PCL proofs. and gives a new presentation of PCL semantics involving honest and unconstrained principals. Other papers on PCL provide additional axioms, proof rules, and case studies of standardized protocols in
协议组合逻辑
协议组合逻辑(PCL)是一种用于证明网络协议的认证和保密特性的逻辑。本章介绍了PCL的核心概念,包括协议编程语言、存在网络攻击者时协议执行的语义、PCL断言的语法和语义,以及证明身份验证属性的公理和证明规则。演示文稿利用了一个增强了子类型的逻辑框架,为机械化PCL证明奠定了基础。给出了包含诚实和无约束主体的PCL语义的一种新的表述。其他关于PCL的论文提供了额外的公理、证明规则和标准化协议的案例研究
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信