.png){kind=icon}
返回
Privacy-Constrained Parallel Distributed Neyman-Pearson Test
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2016.2623092.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the privacy leakage problem in an eavesdropped parallel distributed binary hypothesis test network is considered. A novel Neyman-Pearson test-operational privacy leakage measure is proposed and a privacy-constrained distributed Neyman-Pearson test problem is formulated. Such privacy-constrained distributed Neyman-Pearson test network is designed to optimize the Neyman-Pearson test performance and meanwhile to satisfy a desired suppression constraint on the privacy leakage. This study characterizes the privacy-constrained distributed Neyman-Pearson test network design and particularly identifies the sufficiency of deterministic likelihood-ratio test for optimality. These results help to simplify the optimal design problem of a privacy-constrained distributed Neyman-Pearson test network. Numerical results are presented to show the trade-off between the test performance and privacy leakage in privacy-constrained distributed Neyman-Pearson test networks.
Keyword:
Cyber-physical system
eavesdropper
likelihood-ratio test
person-by-person optimality
physical-layer secrecy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
736
被引数:
1.9K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容