一种新的协议分析框架

Q2 Computer Science

Journal of Internet Services and Information Security Pub Date : 2011-10-16 DOI:10.22667/JISIS.2011.08.31.089

Kristian Gjøsteen, G. Petrides, Asgeir Steine

{"title":"一种新的协议分析框架","authors":"Kristian Gjøsteen, G. Petrides, Asgeir Steine","doi":"10.22667/JISIS.2011.08.31.089","DOIUrl":null,"url":null,"abstract":"We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Novel Framework for Protocol Analysis\",\"authors\":\"Kristian Gjøsteen, G. Petrides, Asgeir Steine\",\"doi\":\"10.22667/JISIS.2011.08.31.089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.\",\"PeriodicalId\":36718,\"journal\":{\"name\":\"Journal of Internet Services and Information Security\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Internet Services and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22667/JISIS.2011.08.31.089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Services and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22667/JISIS.2011.08.31.089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 4

摘要

我们描述了Canetti的通用可组合性(UC)框架的一种新的重新表述，用于分析密码协议。我们的框架主要是不同的，因为它(a)基于具有固定通信图的交互式图灵机系统，(b)增加了一个全局消息队列，允许每次激活发送多个消息。第一个特性极大地简化了一些框架结果的证明，例如UC定理，而第二个特性可以导致对协议和理想功能的更自然的描述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Novel Framework for Protocol Analysis

We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Internet Services and Information Security Computer Science-Computer Science (miscellaneous)

CiteScore

3.90

自引率

0.00%

发文量

审稿时长

8 weeks