通用泄漏函数和适应性对手下的定量信息流
Quantitative information flow under generic leakage functions and adaptive adversaries
摘要:
我们提出了一个基于行动的随机化机制模型,分析定量信息流(QIF)下的通用泄漏功能,并在可能的适应性对手。该模型包含了迄今为止提出的许多QIF模型。我们的主要贡献包括:(1)我们确定了泄漏函数上的温和的一般条件,在此条件下,可以导出自适应QIF的一般和有意义的结果;(2)我们比较了自适应和非自适应策略的效率,表明后者在长度上与前者一样有效,直到可用动作数的扩展因子;(3)我们证明了在有限时间范围内,策略上的最大信息泄漏可以用Bellman方程表示。这可以用来计算一个最佳的有限策略递归,通过诉诸标准的方法,如逆向归纳。
英文摘要:
We put forward a model of action-based randomization mechanisms to analyse quantitative information flow (QIF) under generic leakage functions, and under possibly adaptive adversaries. This model subsumes many of the QIF models proposed so far. Our main contributions include the following: (1) we identify mild general conditions on the leakage function under which it is possible to derive general and significant results on adaptive QIF; (2) we contrast the efficiency of adaptive and non-adaptive strategies, showing that the latter are as efficient as the former in terms of length up to an expansion factor bounded by the number of available actions; (3) we show that the maximum information leakage over strategies, given a finite time horizon, can be expressed in terms of a Bellman equation. This can be used to compute an optimal finite strategy recursively, by resorting to standard methods like backward induction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。