摘要
随着移动终端的日益普及和通信技术的飞速发展,基于位置的服务应用愈发广泛。但用户的位置信息时常涉及个人隐私,因此如何在确保服务质量的同时防止用户隐私的泄露是当前研究的热点问题。文中提出了一种分布式结构下基于用户协作的匿名区域构建算法,该方法在设定范围内随机选取锚点,并通过逐跳广播的方式搜寻协作用户,直至满足匿名需求。在协作用户响应过程中,用户计算自身到锚点的距离,形成以锚点为圆心的匿名区域。实验结果表明,该方法可有效抵御共谋攻击和匿名中心攻击,同时能较大程度地降低平均匿名面积。
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.
作者
吴丹丹
吕鑫
WU Dan-dan;LYU Xin(College of Computer and Information,Hohai University,Nanjing 210000,China)
出处
《计算机科学》
CSCD
北大核心
2019年第4期158-163,共6页
Computer Science
基金
国家重点研发计划课题(2018YFC0407105
2016YFC0400910)
国家自然科学基金面上项目(61272543)
NSFC-广东联合基金重点项目(U1301252)资助
关键词
P2P
位置隐私
锚点
欧氏距离
P2P
Location privacy
Anchor
Euclidean distance