无新鲜度检查的有限安全协议的保密性

2009 Third International Conference on Emerging Security Information, Systems and Technologies Pub Date : 2009-06-18 DOI:10.1109/SECURWARE.2009.13

Catalin V. Bîrjoveanu

{"title":"无新鲜度检查的有限安全协议的保密性","authors":"Catalin V. Bîrjoveanu","doi":"10.1109/SECURWARE.2009.13","DOIUrl":null,"url":null,"abstract":"The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open.","PeriodicalId":382947,"journal":{"name":"2009 Third International Conference on Emerging Security Information, Systems and Technologies","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secrecy for Bounded Security Protocols without Freshness Check\",\"authors\":\"Catalin V. Bîrjoveanu\",\"doi\":\"10.1109/SECURWARE.2009.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open.\",\"PeriodicalId\":382947,\"journal\":{\"name\":\"2009 Third International Conference on Emerging Security Information, Systems and Technologies\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Third International Conference on Emerging Security Information, Systems and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECURWARE.2009.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Emerging Security Information, Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECURWARE.2009.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

安全协议的保密问题是确定给定的安全协议是否有泄漏运行的问题。没有新鲜度检查的有界安全协议的保密问题的复杂性仍然是开放的。本文证明了不需要新鲜度校验的有界安全协议保密问题的dexptime -完备性，解决了该问题的开放性。

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

查看原文本刊更多论文

Secrecy for Bounded Security Protocols without Freshness Check

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open.

求助全文

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

来源期刊

2009 Third International Conference on Emerging Security Information, Systems and Technologies

自引率

0.00%

发文量