arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.02069cs.CR
收藏

基于隐私保护的聚合算法的最优选址

Privacy-Preserving Aggregate Queries for Optimal Location Selection

Emre Yilmaz, Hakan Ferhatosmanoglu, Erman Ayday, Remzi Can Aksoy

摘要:

如今,各种服务提供商收集了大量的位置数据。这些位置数据所有者很清楚他们的用户大部分时间在哪里。其他企业也希望使用这些信息进行位置分析,例如为新分支机构找到最佳位置。然而,位置数据所有者不能与其他企业共享他们的数据,主要是出于隐私和法律方面的考虑。在本文中,我们提出了隐私保护的解决方案,其中基于位置的查询可以回答数据所有者不与其他企业共享他们的数据,而不访问敏感信息,如发送查询的企业的客户列表。我们利用一个部分同态密码系统作为所提出的协议的构建块。在半诚实威胁模型下证明了协议的安全性。我们还解释了如何实现差分隐私在建议的协议,并讨论其效用的影响。我们用真实和合成数据集评估了协议的性能,并表明所提出的解决方案是非常实用的。拟议的解决方案将促进实体之间有效共享敏感数据,并在广泛的应用程序中进行联合分析,而不会侵犯客户的隐私。

英文摘要:

Today, vast amounts of location data are collected by various service providers. These location data owners have a good idea of where their users are most of the time. Other businesses also want to use this information for location analytics, such as finding the optimal location for a new branch. However, location data owners cannot share their data with other businesses, mainly due to privacy and legal concerns. In this paper, we propose privacy-preserving solutions in which location-based queries can be answered by data owners without sharing their data with other businesses and without accessing sensitive information such as the customer list of the businesses that send the query. We utilize a partially homomorphic cryptosystem as the building block of the proposed protocols. We prove the security of the protocols in semi-honest threat model. We also explain how to achieve differential privacy in the proposed protocols and discuss its impact on utility. We evaluate the performance of the protocols with real and synthetic datasets and show that the proposed solutions are highly practical. The proposed solutions will facilitate an effective sharing of sensitive data between entities and joint analytics in a wide range of applications without violating their customers' privacy.

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

↑