吴忠忠,吕鑫,李鑫.基于查询概率的假位置选择算法[J].计算机科学,2018,45(5):143-146, 162
基于查询概率的假位置选择算法
Query Probability Based Dummy Location Selection Algorithm
投稿时间:2017-05-26  修订日期:2017-08-13
DOI:10.11896/j.issn.1002-137X.2018.05.024
中文关键词:  位置服务,K匿名,查询概率,假位置,边信息
英文关键词:Location-based service,K-anonymity,Query probability,Dummy location,Side information
基金项目:本文受国家重点研发计划(2016YFC0400910),国家重大专项(2017ZX07104-001)资助
作者单位
吴忠忠 河海大学计算机与信息学院 南京211100 
吕鑫 河海大学计算机与信息学院 南京211100 
李鑫 河海大学计算机与信息学院 南京211100 
摘要点击次数: 298
全文下载次数: 208
中文摘要:
      位置服务(Location-based Service,LBS)已经成为日常生活的重要组成部分。用户在享受位置服务带来的巨大便利的同时,也面临着巨大的隐私泄露风险。针对传统的位置隐私保护中K-匿名机制没有考虑到攻击者具有背景知识或者边信息的问题,提出了一种改进的假位置选择算法来保护位置隐私。该方法首先对样本空间进行网格划分,并基于历史查询数据计算出每个位置单元的查询概率;再结合历史查询概率为用户寻找(K-1)个假位置,使得这(K-1)个假位置的历史查询概率与用户所在位置的历史查询概率尽量相同,并且使这K个位置尽量 分散。实验结果证明了该算法在位置隐私保护方面的有效性。
英文摘要:
      Location-based service(LBS) has become a vital part in daily life.While enjoying the convenience providedby LBS,users may have high risk of losing privacy.Traditional K-anonymity for location privacy does not consider that adversaries have some problems of background knowledge and side information.Therefore,this paper proposed an improved dummy locations selection algorithm to protect location privacy.Firstly,the space is divided into grids,and historical statistics are utilized to obtain the probability of queries of each grid of space.Then,the dummy locations are selected for users in order that the(K-1) grids has the same query probability as far as possible corresponding with the grid where the real user exists and the K locations are spread as far as possible.A series of experiments on synthetic datasets show that this algorithm is feasible and effective.
查看全文  查看/发表评论  下载PDF阅读器