分布式结构下基于用户协作的匿名区域构建算法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Location Anonymous Algorithm Based on User Collaboration under Distributed Structure
  • 作者:吴丹丹 ; 吕鑫
  • 英文作者:WU Dan-dan;LYU Xin;College of Computer and Information,Hohai University;
  • 关键词:P2P ; 位置隐私 ; 锚点 ; 欧氏距离
  • 英文关键词:P2P;;Location privacy;;Anchor;;Euclidean distance
  • 中文刊名:JSJA
  • 英文刊名:Computer Science
  • 机构:河海大学计算机与信息学院;
  • 出版日期:2019-04-15
  • 出版单位:计算机科学
  • 年:2019
  • 期:v.46
  • 基金:国家重点研发计划课题(2018YFC0407105,2016YFC0400910);; 国家自然科学基金面上项目(61272543);; NSFC-广东联合基金重点项目(U1301252)资助
  • 语种:中文;
  • 页:JSJA201904025
  • 页数:6
  • CN:04
  • ISSN:50-1075/TP
  • 分类号:164-169
摘要
随着移动终端的日益普及和通信技术的飞速发展,基于位置的服务应用愈发广泛。但用户的位置信息时常涉及个人隐私,因此如何在确保服务质量的同时防止用户隐私的泄露是当前研究的热点问题。文中提出了一种分布式结构下基于用户协作的匿名区域构建算法,该方法在设定范围内随机选取锚点,并通过逐跳广播的方式搜寻协作用户,直至满足匿名需求。在协作用户响应过程中,用户计算自身到锚点的距离,形成以锚点为圆心的匿名区域。实验结果表明,该方法可有效抵御共谋攻击和匿名中心攻击,同时能较大程度地降低平均匿名面积。
        With the increasing popularity of mobile terminals and the rapid development of communication technology,location-based service applications have been widely used in people's daily life.However,the users' location information is commonly privacy-related.Thus,how to preserve users' privacy while guaranteeing the service quality has become a hot issue in current research.An anonymous region constructing algorithm,through collaborating users,was proposed in this paper.The anchor is randomly selected in the designed set,and the cooperative users can be discovered by broadcasting hop-by-hop,until the anonymous demand is satisfied.During the collaboration responding process,the anchor-centered anonymous region is formed based on the distance between the user and the anchor.The experimental results show that the proposed algorithm is able to effectively resist collusion attacks and anonymous center attacks,meanwhile,the average area of anonymous region is greatly decreased.
引文
[1] GRUTESER M,GRUNWALD D.Anonymous usage of loca- tion-based services through spatial and temporal cloaking[C]//1st ACM International Conference on Mobile Systems,Applications,and Services.SanFrancisco,United States,2003:31-42.
    [2] NIU B,et al.Achieving k-anonymity in privacy-aware location-based services[C]//33th IEEE International Conference on Computer Communications.Toronto,Canada,2014:754-762.
    [3] LIU H,LI X H.Privacy enhancing method for dummy-based privacy protection with continuous location-based service queries[J].Journal on Communications,2016,37(7):140-150.(in Chinese)刘海,李兴华.连续服务请求下基于假位置的用户隐私增强方法[J].通信学报,2016,37(7):140-150.
    [4] PEI Z X,LI X H,LIU H.Anonymizing region construction scheme based on query range in location-based service privacy protection[J].Journal on Communications,2017,38(9):125-132.(in Chinese)裴卓雄,李兴华,刘海.LBS隐私保护中基于查询范围的匿名区构造方案[J].通信学报,2017,38(9):125-132.
    [5] YIU M L,JENSEN C S,M?LLER J,et al.Design and analysis of aranking approach to private location-based services[J].ACM Transactionson Database Systems,2011,36(2):1-42.
    [6] HUANG Y,HUO Z,MENG X F.CoPrivacy:A Collaborative Location Privacy-Preserving Method without Cloaking Region[J].Chinese Journal of Computers,2011,34(10):1976-1985.(in Chinese)黄毅,霍峥,孟小峰.CoPrivacy:一种用户协作无匿名区域的位置隐私保护方法[J].计算机学报,2011,34(10):1976-1985.
    [7] PERAZZO P.A uniformity-based approach to location privacy[J].Computer Communications,2015,64(1):21-32.
    [8] ANDRES M E,BORDENABE N E,et al.Geo-indistinguishability:differential privacy for location-based systems[C]//20th ACM Conference on Computer and Communications Security(CCS’13).Berlin,Germany,2013:901-914.
    [9] ZHANG L,MA C G.Correlation probability indistinguishable location privacy protection algorithm[J].Journal on Communications,2017,38(8):37-49.(in Chinese)张磊,马春光.关联概率不可区分的位置隐私保护方法[J].通信学报,2017,38(8):37-49.
    [10] CHOW C Y,MOKBEL M F,LIU X.A peer-to-peer spatial cloaking algorithm for anonymous location-based services[C]//14th ACM International Symposium on Advances in Geographic information Systems(ACM-GIS’06).Arlington,USA,2006:171-178.
    [11] CHOW C Y,MOKBEL M F,LIU X.Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments[J].GeoInformatica,2011,15(2):351-380.
    [12] ASHOUR-TALOUKIM:a cryptographic approach for group location privacy[J].Computer Communications,2012,35(12):1527-1533.
    [13] MANWEILER J,SCUDELLARI R,COX L P.SMILE:encounter-based trust for mobile social services[C]//16th ACM Conference on Computer and Communications Security(CCS’09).Chicago,United States,2009:246-255.
    [14] CRUTESER M,GRUNWALD D.Anonymous usage of location-based services through spatial and temporal cloaking[C]//Proceedings of the 1st International Conference on Mobile System,Applications and Services,ACM,2003:31-42.
    [15] CHOW C Y,MOKBEL M F.Casper*:query processing for location services without compromising privacy[J].ACM Tran-sactionson Database Systems,2009,34(4):1-48.
    [16] WANG J H,CHENG J J.Spatial Cloaking Algorithm Based on Grid Expansion in P2P Mode[J].Computer Science,2014,4(41):90-94.(in Chinese)王嘉慧,程久军.P2P模式下基于网格扩增的位置匿名算法[J].计算机科学,2014,4(41):90-94.
    [17] ASHOURI-TALOUKI M,BARAANI-DASTJERDI A,SEL- CUK A A.GLP:a cryptographic approach for group location privacy[J].Computer Communications,2012,35(12):1527-1533.
    [18] GAO S,MA J F.Towards cooperation location privacy-preser- vinggroup nearest neighbor queries in LBS[J].Journal on Communications,2015,36(3):146-154.(in Chinese)高胜,马建峰.LBS中面向协同位置隐私保护的群组最近邻查询[J].通信学报,2015,36(3):146-154.