对称约束下信息泄漏的广义熵与度量不变最优对策
Generalised Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage under Symmetric Constraints
摘要：
我们介绍了一种新的广义熵和条件熵，从文献中的大多数定义可以推导出的特殊情况。在这个框架内，我们研究的问题，设计对策的信息泄漏。特别是，我们寻求度量不变的解决方案，即，它们对于用于量化泄漏的熵的选择是鲁棒的。这个问题可以被建模为从系统到对手的信息通道，而对策可以被看作是修改这个通道，以最大限度地减少输出揭示的输入信息量。我们的主要结果是完全解决问题的高度对称的设计约束下，可以产生相同的输出的输入数量是上限。我们的证明是建设性的，最佳渠道和最小泄漏的封闭形式。
英文摘要：
We introduce a novel generalization of entropy and conditional entropy from which most definitions from the literature can be derived as particular cases. Within this general framework, we investigate the problem of designing countermeasures for information leakage. In particular, we seek metric-invariant solutions, i.e., they are robust against the choice of entropy for quantifying the leakage. The problem can be modelled as an information channel from the system to an adversary, and the countermeasures can be seen as modifying this channel in order to minimise the amount of information that the outputs reveal about the inputs. Our main result is to fully solve the problem under the highly symmetrical design constraint that the number of inputs that can produce the same output is capped. Our proof is constructive and the optimal channels and the minimum leakage are derived in closed form.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
