基于分散子匿名区域的位置隐私保护方法  

The location privacy protection method w ith dispersed sub cloaking region

作　　者：赵泽茂[1] 李林[1] 张帆[1,2] 张品[1] 周建钦[1] 王家波[1] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018 [2]武汉轻工大学数学与计算机学院,湖北武汉430023

出　　处：《山东大学学报（理学版）》2013年第7期56-61,共6页Journal of Shandong University(Natural Science)

基　　金：浙江省自然科学基金资助项目(Y1100818);浙江省教育厅基金资助项目(Y201224055)

摘　　要：针对传统匿名方法存在查询结果不精确、通信开销大等不足,提出一种新的位置匿名方法,并为匿名模型提出了基于熵的隐私度量方法。相对于传统的匿名方法而言,该方法将匿名区域分裂为几个分散的子匿名区域,并用子匿名区域的中心位置代替子匿名内用户的真实位置向LBS服务器发起查询。该方法能使用户在保护自身隐私的同时相对地得出自己的精确查询结果。理论分析表明,该方法能将匿名器与LBS服务器之间的通信量降到最低,提高查询服务的质量。在用户稀少的场景下,方法的优越性更加明显。In view of traditional anonymous scheme exists imprecise query results and communication overhead defect, a new kind of location anonymity scheme is proposed, and the privacy measurement method based on entropy for the a- nonymous model is put forward. Compared with the traditional anonymous scheme, this one divides single cloaking re- gion into several sub cloaking regions, and replace the users＇ real position with the central location of sub cloaking re- gion which the users belong to, then initiate a query from LBS server. This scheme can ensure users to protect their own privacy and achieve accurate query results relatively. Theorectical analysis shows that the scheme can minimize the com- munication traffic between anonymous device and LBS server, and improve the quality of query service. In the spare user scenario, the superiority of the scheme is more obvious.

关 键 词：隐私保护 位置服务(LBS) K-匿名 子匿名区域 熵 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]