基于维诺图的位置隐私最近邻查询方法

    Location Nearest Neighbor Query Method Based on Voronoi Map

    • 摘要: 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了一种抗连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思想以及维诺图算法,在可信第三方生成K-匿名集,用基于位置的服务(location based service,LBS)运营方服务器上存储的兴趣点(point of interest,POI)划分维诺图,基于用户与POI之间的邻近关系生成关系矩阵;用K-匿名集生成的离散维诺图构成匿名空间,以抵抗多查询攻击,保护用户位置隐私安全;用私有信息检索(privacy information retrieval,PIR)技术保护用户兴趣点查询隐私的安全.在保证关系矩阵匿名度的同时,也确保了K-匿名集的用户查询位置语义的单一性,以不同的维诺图划分集合,确保了l-多样性.

       

      Abstract: With the rapid development of location services, the problem of privacy disclosure in location queries is becoming more and more severe. A variety of privacy protection algorithms came into being. To overcome the shortcomings of K-anonymous, spatial anonymity, location blur and other privacy protection methods, a location nearest neighbor query method based on Voronoi Mapagainst continuous multi-query attacks was proposed. Based on the K-anonymous idea and the Voronoi Map algorithm, the K-user anonymous set was generated by the trusted third party, and the Vino diagram was divided by the point of interest (POI) stored in the LBS server. The relationship matrix was generated by the distance between the user and the POI. The discrete Vino chart generated by the K-anonymous user set constituted an anonymous space to resist multi-query attacks and protected the user's location from privacy. User interest point query privacy was protected by private information retrieval technology. While ensuring the anonymity of the relation matrix, the singularity of the semantics of user and l-diversity was by dividing the set with different Vino diagrams. By the method, not only the privacy of location information and query information was ensured, but also the process of security, server-side security and the efficiency of the query were guaranteed.

       

    /

    返回文章
    返回