arXiv:2502.10552eess.SYcs.AI2025-02中稿 · ICCPS 2025被引 7

用动态掩码降低系统信息泄露,提升隐私保护

Synthesis of Dynamic Masks for Information-Theoretic Opacity in Stochastic Systems

  • 以条件熵量化信息泄露,构建可优化的隐私保护机制
  • 在成本约束下最大化最终状态保密性,实现最优遮蔽策略
  • 适用于需保护敏感状态的随机系统,如智能交通与安防

本文研究随机系统中动态信息释放机制(即“掩码”)的合成,旨在最小化系统向外部观察者泄漏的信息。具体而言,观察者试图推断系统轨迹的最终状态是否属于一组秘密状态。动态掩码通过调节传感器信息,使观察者对最终状态的不确定性最大化,这一性质称为终态保密性。现有监督控制文献主要处理定性保密性,而本文提出使用条件熵量化随机系统中的保密性,该指标是信息安全中信息泄露的度量。随后,我们建立一个带总成本约束的优化问题,以合成最大化终态保密性的动态掩码。为求解该约束优化问题,我们提出一种新颖的原始-对偶策略梯度方法,并设计了基于隐马尔可夫模型可观测算子的条件熵梯度计算技术。通过一个示例和一个随机网格世界场景验证,结果表明该算法可在成本约束下有效实现终态保密性。

原文摘要 · Abstract (English)

In this work, we investigate the synthesis of dynamic information releasing mechanisms, referred to as ''masks'', to minimize information leakage from a stochastic system to an external observer. Specifically, for a stochastic system, an observer aims to infer whether the final state of the system trajectory belongs to a set of secret states. The dynamic mask seeks to regulate sensor information in order to maximize the observer's uncertainty about the final state, a property known as final-state opacity. While existing supervisory control literature on dynamic masks primarily addresses qualitative opacity, we propose quantifying opacity in stochastic systems by conditional entropy, which is a measure of information leakage in information security. We then formulate a constrained optimization problem to synthesize a dynamic mask that maximizes final-state opacity under a total cost constraint on masking. To solve this constrained optimal dynamic mask synthesis problem, we develop a novel primal-dual policy gradient method. Additionally, we present a technique for computing the gradient of conditional entropy with respect to the masking policy parameters, leveraging observable operators in hidden Markov models. To demonstrate the effectiveness of our approach, we apply our method to an illustrative example and a stochastic grid world scenario, showing how our algorithm optimally enforces final-state opacity under cost constraints.

隐私保护随机系统动态掩码信息论

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。