arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.6556cs.DB
收藏

与多个非合谋对手共享私有数据

On Sharing Private Data with Multiple Non-Colluding Adversaries

Theodoros Rekatsinas, Amol Deshpande, Ashwin Machanavajjhala

摘要:

我们提出了SPARSI,一个理论框架划分敏感数据在多个非勾结的对手。隐私感知数据共享中的大多数工作都考虑公开摘要,其中关于数据的聚合信息被保留,但敏感的用户信息被保护。尽管如此,仍有一些应用,包括在线广告、云计算和众包市场,必须披露详细和细粒度的用户数据。我们考虑一个新的数据共享范例,并引入了隐私感知数据分区的问题,其中一个敏感的数据集必须在k个不受信任的方(对手)之间进行分区。目标是最大化通过划分和分布数据集而获得的效用,同时最小化所公开的敏感信息的量。数据的分布应使对手在不与其他对手串通的情况下,无法通过将向其发布的多条信息链接在一起来得出关于私人信息的额外推断。在上述需要发布私人用户信息的应用领域中,没有串通的假设是合理且必要的。SPARSI使我们能够正式定义隐私感知的数据分区使用敏感属性的概念建模的私人信息和超图表示描述之间的相互依赖关系的数据录入和私人信息。我们发现,解决隐私意识的划分,在一般情况下,NP-难,但对于特定的信息披露功能,可以找到良好的近似解决方案,使用松弛技术。最后,我们提出了一个局部搜索算法适用于一般的信息披露功能。我们将SPARSI与所提出的算法一起应用于来自真实广告场景的数据,并表明我们可以对数据进行分区,而不会向任何单个广告商披露。

英文摘要:

We present SPARSI, a theoretical framework for partitioning sensitive data across multiple non-colluding adversaries. Most work in privacy-aware data sharing has considered disclosing summaries where the aggregate information about the data is preserved, but sensitive user information is protected. Nonetheless, there are applications, including online advertising, cloud computing and crowdsourcing markets, where detailed and fine-grained user-data must be disclosed. We consider a new data sharing paradigm and introduce the problem of privacy-aware data partitioning, where a sensitive dataset must be partitioned among k untrusted parties (adversaries). The goal is to maximize the utility derived by partitioning and distributing the dataset, while minimizing the amount of sensitive information disclosed. The data should be distributed so that an adversary, without colluding with other adversaries, cannot draw additional inferences about the private information, by linking together multiple pieces of information released to her. The assumption of no collusion is both reasonable and necessary in the above application domains that require release of private user information. SPARSI enables us to formally define privacy-aware data partitioning using the notion of sensitive properties for modeling private information and a hypergraph representation for describing the interdependencies between data entries and private information. We show that solving privacy-aware partitioning is, in general, NP-hard, but for specific information disclosure functions, good approximate solutions can be found using relaxation techniques. Finally, we present a local search algorithm applicable to generic information disclosure functions. We apply SPARSI together with the proposed algorithms on data from a real advertising scenario and show that we can partition data with no disclosure to any single advertiser.

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

↑