Abstract:

Most existing [k]-anonymity location privacy protection mechanism constructs anonymous locations set through retrieving historical request database, which takes a significant amount of time. To solve this issue, according to the rapid search superiority of Geohash coding, a location-based privacy protection method based on interval region is proposed. This approach first generalizes user real location to the interval region, and then indexes the location with the same code based on the Geohash coding principle as a candidate location set, and then provides personalized [k]-anonymous privacy protection service for the user, which satisfies user privacy requirements. Simulation results show that in the same size retrieval range, this approach can not only retrieve quickly, but also provide users with more secure location service.

Key words: [k]-anonymity mechanism, Geohash encoding, interval region, location privacy protection

摘要：

现有的[k]-匿名位置隐私保护机制通过检索历史请求记录来构造匿名位置集，而检索需要花销大量的时间。针对这一问题，运用Geohash编码快速检索的优越性，提出了基于区间区域的位置隐私保护方法。将用户的真实位置泛化到区间区域中，根据Geohash编码原理来检索相同编码的位置作为候选位置集，再根据用户的隐私需求，为用户提供个性化的[k]-匿名隐私保护服务。仿真实验表明，在相同大小的检索范围内，该方法不仅可以快速地进行匿名处理，还能够给用户提供更加高效安全的位置服务。

关键词: k-匿名机制, Geohash编码, 区间区域, 位置隐私保护