arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.00275cs.LGcs.CRstat.ML
收藏

信息物理系统统计验证的差分私有算法

Differentially Private Algorithms for Statistical Verification of Cyber-Physical Systems

University of Florida(佛罗里达大学);University of California, Berkeley(加州大学伯克利分校);University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Yu Wang, Hussein Sibai, Mark Yen, Sayan Mitra, Geir E. Dullerud

摘要:

统计模型检验是一类顺序算法,其可以验证信息物理系统的集合上的感兴趣的规范(例如,是否99%的汽车从一批满足要求的能源效率)。这些算法通过抽取足够数量的独立同分布样本来推断具有可证明的统计保证的系统满足给定规格的概率。在统计模型检验的过程中,样本的值(例如,用户的汽车能量效率)可能被入侵者推断,引起消费者级应用中的隐私问题(例如,汽车和医疗设备)。本文从差分隐私的角度研究了统计模型检验算法的隐私问题。这些算法是连续的,绘制样本直到满足其值的条件。我们表明,透露抽取的样本数量可能会侵犯隐私。我们还表明,标准的指数机制,随机化的算法的输出,以实现差分隐私未能做到这一点的上下文中的顺序算法。相反,我们放松了保守的要求,在差分隐私的算法的输出的灵敏度应该是有界的任何数据集的任何扰动。本文提出了一种新的差分隐私概念,我们称之为期望差分隐私。然后,我们提出了一种新的预期灵敏度分析的顺序算法,并提出了相应的指数机制,随机终止时间,以实现预期的差分隐私。我们提出的机制,统计模型检验算法,以保护隐私的样本,他们提请。所提出的算法的效用证明在一个案例研究。

英文摘要:

Statistical model checking is a class of sequential algorithms that can verify specifications of interest on an ensemble of cyber-physical systems (e.g., whether 99% of cars from a batch meet a requirement on their energy efficiency). These algorithms infer the probability that given specifications are satisfied by the systems with provable statistical guarantees by drawing sufficient numbers of independent and identically distributed samples. During the process of statistical model checking, the values of the samples (e.g., a user's car energy efficiency) may be inferred by intruders, causing privacy concerns in consumer-level applications (e.g., automobiles and medical devices). This paper addresses the privacy of statistical model checking algorithms from the point of view of differential privacy. These algorithms are sequential, drawing samples until a condition on their values is met. We show that revealing the number of the samples drawn can violate privacy. We also show that the standard exponential mechanism that randomizes the output of an algorithm to achieve differential privacy fails to do so in the context of sequential algorithms. Instead, we relax the conservative requirement in differential privacy that the sensitivity of the output of the algorithm should be bounded to any perturbation for any data set. We propose a new notion of differential privacy which we call expected differential privacy. Then, we propose a novel expected sensitivity analysis for the sequential algorithm and proposed a corresponding exponential mechanism that randomizes the termination time to achieve the expected differential privacy. We apply the proposed mechanism to statistical model checking algorithms to preserve the privacy of the samples they draw. The utility of the proposed algorithm is demonstrated in a case study.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑