两种基于Quad-Tree的匿名算法

摘要

The LBS brings tremendous convenience,it also implies the disclosure of location privacy.To protect users' location privacy,an effective method for protection is to cloak the user's exact coordinates into a spatial region.Existing Quad-tree-based algorithms incur high cloaking time and low accuracy.To address this issue, the paper presents two cloaking algorithms, namely QFC and SWC.In constrast to traditional cloaking algorithm(Casper).QFC can reduce the CPU time significantly at the same cloaking accuracy.SWC can achieve a higher cloaking accuracy than Casper at the cost of certain CPU time.%基于位置的服务(LBS)给人们带来巨大便利的同时可能导致位置隐私的泄露.为了保护用户的位置隐私,一种有效的方法是将用户的精确位置匿名成一个空间区域,现有基于Quad-Tree的匿名算法导致匿名时间较长并且准确度较低.提出两种匿名算法QFC和SWC,与传统的匿名算法(Casper)相比,QFC算法在保持匿名准确度相同的情况下,可以减少CPU时间;SWC算法以牺牲一定的CPU时间为代价,可以达到较高的匿名准确度.