Observability Blocking for Functional Privacy of Linear Dynamic Networks
원문 초록
This paper addresses the problem of determining the minimum set of state variables in a network that need to be blocked from direct measurements in order to protect functional privacy with respect to {\emph{any}} output matrices. The goal is to prevent adversarial observers or eavesdroppers from inferring a linear functional of states, either vector-wise or entry-wise. We prove that both problems are NP-hard. However, by assuming a reasonable constant bound on the geometric multiplicities of the system's eigenvalues, we present an exact algorithm with polynomial time complexity for the vector-wise functional privacy protection problem. Based on this algorithm, we then provide a greedy algorithm for the entry-wise privacy protection problem. Our approach is based on relating these problems to functional observability and leveraging a PBH-like criterion for functional observability. Finally, we provide an example to demonstrate the effectiveness of our proposed approach.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models
NoLoCo: No-all-reduce Low Communication Training Method for Large Models
Open CaptchaWorld: A Comprehensive Web-based Platform for Testing and Benchmarking Multimodal LLM Agents
Progent: Programmable Privilege Control for LLM Agents
Deep Learning Meets Teleconnections: Improving S2S Predictions for European Winter Weather
CORBA: Contagious Recursive Blocking Attacks on Multi-Agent Systems Based on Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.