划分子匿名区域的k-匿名位置隐私保护方法

随着移动计算技术和无线设备的蓬勃发展,位置服务中的隐私保护成为了研究热点。传统的K-匿名方法存在查询结果不精确的缺点,尤其是在用户稀少的场景下,将产生较大的匿名区域,从而增大通信开销。为了平衡服务质量和隐私保护之间的矛盾,依据将匿名区域分裂成几个分散的子匿名区域,提出一种新的划分子匿名区域的方法,该方法将不产生连续的匿名区域而是直接划分出n个子匿名区域,并随机选择一个子匿名区域代替真实用户的位置向LBS服务器发起查询。实验结果表明,该方法能更加有效地保护用户的隐私,并且能够提高服务质量,减少通信开支。

A-anonymous Algorithm in Location Privacy Protection Based on Divide Sub Clocking Region

With the vigorous development of the mobile computing and wireless devices, privacy protection has become a research hotspot in the location service. There is a shortcoming of inaccurate query result for the traditional K-anonymous algorithm, especially in the scarce scenarios, which will produce a larger anonymous area and increase communication costs. In order to balance the contradiction between the quality service and privacy protection, a new method that dividing sub anonymous area is proposed according to dividing the anonymous area into a few scattered ones. This method will not produce continuous anonymous area but divide into n sub anonymous areas directly and choose one sub anonymous area which will take place of the user＇s real location at random to make a query to the LBS service.The experimental results show that the method can more effectively protect the user＇s privacy, improve the quality service and reduce the communication costs.