2010 23rd IEEE Computer Security Foundations Symposium最新文献

筛选

英文中文

Analysing Unlinkability and Anonymity Using the Applied Pi Calculus 应用π演算分析不链接性和匿名性

2010 23rd IEEE Computer Security Foundations Symposium Pub Date : 2010-07-17 DOI: 10.1109/CSF.2010.15

Myrto Arapinis, Tom Chothia, Eike Ritter, M. Ryan

引用次数: 152

Quantitative Information Flow - Verification Hardness and Possibilities 定量信息流-验证的难度和可能性

2010 23rd IEEE Computer Security Foundations Symposium Pub Date : 2010-03-31 DOI: 10.1109/CSF.2010.9

Hirotoshi Yasuoka, Tachio Terauchi

{"title":"Quantitative Information Flow - Verification Hardness and Possibilities","authors":"Hirotoshi Yasuoka, Tachio Terauchi","doi":"10.1109/CSF.2010.9","DOIUrl":"https://doi.org/10.1109/CSF.2010.9","url":null,"abstract":"Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the hardness and possibilities of precisely checking and inferring quantitative information flow according to such definitions. We prove that, even for just comparing two programs on which has the larger flow, none of the definitions is a k-safety property for any k, and therefore is not amenable to the self-composition technique that has been successfully applied to precisely checking non-interference. We also show a complexity theoretic gap with non-interference by proving that, for loop-free boolean programs whose non-interference is coNP-complete, the comparison problem is #P-hard for all of the definitions. For positive results, we show that universally quantifying the distribution in the comparison problem, that is, comparing two programs according to the entropy based definitions on which has the larger flow for all distributions, is a 2-safety problem in general and is coNP-complete when restricted for loop-free boolean programs. We prove this by showing that the problem is equivalent to a simple relation naturally expressing the fact that one program is more secure than the other. We prove that the relation also refines the channel-capacity based definition, and that it can be precisely checked via the self-composition as well as the “interleaved” self-composition technique.","PeriodicalId":309713,"journal":{"name":"2010 23rd IEEE Computer Security Foundations Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 66

首页上一页