当前位置: X-MOL 学术Trans. Emerg. Telecommun. Technol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Differential privacy location data release based on quadtree in mobile edge computing
Transactions on Emerging Telecommunications Technologies ( IF 3.6 ) Pub Date : 2020-04-29 , DOI: 10.1002/ett.3972
Gang Liu 1 , Ziwen Tang 1 , Bo Wan 1 , Yanfei Li 1 , Yan Liu 1
Affiliation  

To preserve user privacy in the release of location data, some researchers have proposed a distributed data release framework and a location data release algorithm based on mobile edge computing. This framework can preserve location privacy even if location-based service providers are not trusted. However, the proposed algorithm fails to balance the noise error and the uniform hypothesis error and fails to take the query consistency constraint into account, so query accuracy needs to be improved. Therefore, we follow this framework and propose a differential privacy quadtree partitioning algorithm based on data uniformity heuristic adjustment to further improve query accuracy. First, a differential privacy complete quadtree is constructed, and then the quadtree is heuristically adjusted based on the predefined noise count threshold and the data uniformity threshold to balance the two types of error. Finally, query consistency processing is performed to further improve query accuracy. Experiments based on real-world datasets are conducted to study the impact of two thresholds on query accuracy. Compared with the previous quadtree-based differential privacy partitioning algorithm, our proposed algorithm has higher query accuracy while preserving location privacy. In addition, to address the problem of location privacy leakage in the query process, a range counting query framework based on the Hilbert curve is proposed to preserve location privacy in the query process.

中文翻译:

移动边缘计算中基于四叉树的差分隐私位置数据发布

为了保护用户在位置数据发布中的隐私,一些研究人员提出了分布式数据发布框架和基于移动边缘计算的位置数据发布算法。即使基于位置的服务提供商不受信任,该框架也可以保护位置隐私。但是,该算法未能平衡噪声误差和统一假设误差,也没有考虑到查询一致性约束,因此查询准确率有待提高。因此,我们遵循这个框架,提出了一种基于数据均匀性启发式调整的差分隐私四叉树划分算法,以进一步提高查询准确率。首先,构造差分隐私完全四叉树,然后根据预定义的噪声计数阈值和数据均匀性阈值对四叉树进行启发式调整,以平衡两类错误。最后进行查询一致性处理,进一步提高查询准确率。进行了基于现实世界数据集的实验,以研究两个阈值对查询准确性的影响。与之前基于四叉树的差分隐私划分算法相比,我们提出的算法在保留位置隐私的同时具有更高的查询准确率。此外,针对查询过程中位置隐私泄露的问题,提出了一种基于希尔伯特曲线的范围计数查询框架来保护查询过程中的位置隐私。进行查询一致性处理,进一步提高查询准确率。进行了基于现实世界数据集的实验,以研究两个阈值对查询准确性的影响。与之前基于四叉树的差分隐私划分算法相比,我们提出的算法在保留位置隐私的同时具有更高的查询准确率。此外,针对查询过程中位置隐私泄露的问题,提出了一种基于希尔伯特曲线的范围计数查询框架来保护查询过程中的位置隐私。进行查询一致性处理,进一步提高查询准确率。进行了基于现实世界数据集的实验,以研究两个阈值对查询准确性的影响。与之前基于四叉树的差分隐私划分算法相比,我们提出的算法在保留位置隐私的同时具有更高的查询准确率。此外,针对查询过程中位置隐私泄露的问题,提出了一种基于希尔伯特曲线的范围计数查询框架来保护查询过程中的位置隐私。我们提出的算法在保留位置隐私的同时具有更高的查询精度。此外,针对查询过程中位置隐私泄露的问题,提出了一种基于希尔伯特曲线的范围计数查询框架来保护查询过程中的位置隐私。我们提出的算法在保留位置隐私的同时具有更高的查询精度。此外,针对查询过程中位置隐私泄露的问题,提出了一种基于希尔伯特曲线的范围计数查询框架来保护查询过程中的位置隐私。
更新日期:2020-04-29
down
wechat
bug