arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.3283cs.CRcs.DC
收藏

关于优化方法的保密性

On the Privacy of Optimization Approaches

Pradeep Chathuranga Weeraddana, George Athanasiou, Martin Jakobsson, Carlo Fischione, John S. Baras

摘要:

确保敏感数据的隐私在许多情况下都是至关重要的,例如医疗保健数据、银行、电子商务、无线传感器网络和社交网络。不同的实体协调或希望依靠第三方来解决特定问题是很常见的。同时,没有实体希望在解决方案过程中发布其问题数据,除非有隐私保证。与基于密码学和差分隐私的方法不同,基于优化的方法缺乏它们可以提供的隐私的量化。本文的主要贡献是提供了一种机制,量化的隐私广泛的优化方法。特别是,我们正式定义了一个一对多的关系,它将一个给定的对抗性观察到的消息与问题数据的不确定性集联系起来。这种关系量化了由于所采用的优化方法而导致的问题数据上的潜在模糊性。隐私定义,然后正式的不确定性集的基础上。分析了所提出的隐私度量的性质。关键的想法是用例子来说明,包括本地化,平均共识,等等。

英文摘要:

Ensuring privacy of sensitive data is essential in many contexts, such as healthcare data, banks, e-commerce, wireless sensor networks, and social networks. It is common that different entities coordinate or want to rely on a third party to solve a specific problem. At the same time, no entity wants to publish its problem data during the solution procedure unless there is a privacy guarantee. Unlike cryptography and differential privacy based approaches, the methods based on optimization lack a quantification of the privacy they can provide. The main contribution of this paper is to provide a mechanism to quantify the privacy of a broad class of optimization approaches. In particular, we formally define a one-to-many relation, which relates a given adversarial observed message to an uncertainty set of the problem data. This relation quantifies the potential ambiguity on problem data due to the employed optimization approaches. The privacy definitions are then formalized based on the uncertainty sets. The properties of the proposed privacy measure is analyzed. The key ideas are illustrated with examples, including localization, average consensus, among others.

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

↑