.png){kind=icon}
返回
Detection in Adversarial Environments
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2014.2351671.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose new game theoretic approaches to estimate a binary random variable based on sensor measurements that may have been corrupted by a cyber-attacker. The estimation problem is formulated as a zero-sum partial information game in which a detector attempts to minimize the probability of an estimation error and an attacker attempts to maximize this probability. While this problem can be solved exactly by reducing it to the computation of the value of a matrix, this approach is computationally feasible only for a small number of sensors. The two key results of this paper provide complementary computationally efficient solutions to the construction of the optimal detector. The first result provides an explicit formula for the optimal detector but it is only valid when the number of sensors is roughly smaller than two over the probability of sensor errors. In contrast, the detector provided by the second result is valid for an arbitrary number of sensor. While it may result in a probability of estimation error that is is an element of above the minimum achievable, we show that this error is an element of is small when the number of sensors is large, which is precisely the case for which the first result does not apply.
Keyword:
Adversarial detection
Byzantine sensors
cyber security
estimation
zero-sum games
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏Multiple wavelength analysis of the reaction between hydrogen peroxide and metmyoglobin.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容