摘要
空间K-匿名技术主要用于隐私保护,防止个人信息泄露。目前的主要方法都基于用户-匿名器-基于位置的服务(location based services,LBS)模型。提出了一种基于位置敏感哈希分割的空间K-匿名共匿算法。这种算法在保距性和共匿性方面都可以满足要求,而且算法具有适度的计算复杂度。最后,针对有效性(最小化匿名空间区域)和效率(构建代价)做了实验,证明所提出的算法具有良好的性能。
Spatial K-anonymity is an important measure for privacy to prevent the disclosure of personal data. The main methods are based on the model of User-Anonymizer-LBS. This paper proposed a spatial K-anonymity algorithm based on locality-sensitive hashing partition. The algorithm is shown to preserve both locality and reciprocity with moderate computation complexity. Finally, aimed on effectiveness(minimum anonymizing spatial region size)and efficiency(con- struction cost), the experimental results verify that the proposed method has high performance.
出处
《计算机科学》
CSCD
北大核心
2013年第8期115-118,共4页
Computer Science
基金
国家自然科学基金(61070032)资助
关键词
基于位置的服务
空间K-匿名
隐私保护
空间数据库
Location-based services
Spatial K-anonymity
Privacy protection
Spatial databases