Exploitation as an inference problem

David A. Cock
{"title":"Exploitation as an inference problem","authors":"David A. Cock","doi":"10.1145/2046684.2046702","DOIUrl":null,"url":null,"abstract":"In this position paper, we suggest that an adversary seeking to exploit a side channel should be viewed as performing inference under uncertainty. We propose a set of vulnerability measures that incorporate both observational effort and computational effort. by deriving Boolean satisfiability as a special case of the marginalization problem, we justify that the measure is capable of capturing the complexity of the underlying deterministic decision problem. In the limit of unbounded computation the measure reduces to the efficiency (in number of observations) of naïve Bayesian analysis. We further hypothesize that in the limit of unbounded observations, the measure reduces to the complexity of the decision problem.","PeriodicalId":225009,"journal":{"name":"Security and Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Security and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2046684.2046702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this position paper, we suggest that an adversary seeking to exploit a side channel should be viewed as performing inference under uncertainty. We propose a set of vulnerability measures that incorporate both observational effort and computational effort. by deriving Boolean satisfiability as a special case of the marginalization problem, we justify that the measure is capable of capturing the complexity of the underlying deterministic decision problem. In the limit of unbounded computation the measure reduces to the efficiency (in number of observations) of naïve Bayesian analysis. We further hypothesize that in the limit of unbounded observations, the measure reduces to the complexity of the decision problem.
作为推理问题的开发
在本立场文件中,我们建议寻求利用侧信道的对手应被视为在不确定性下进行推理。我们提出了一套脆弱性措施,包括观察努力和计算努力。通过推导作为边缘化问题的一个特例的布尔可满足性,我们证明了该度量能够捕获潜在确定性决策问题的复杂性。在无界计算的极限下,度量降低到naïve贝叶斯分析的效率(在观测数上)。我们进一步假设,在无界观测的极限下,度量降低到决策问题的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书