当前位置:主页 > 经济论文 > 电子商务论文 >

位置服务中隐私保护连续近邻查询关键技术研究

发布时间:2018-06-13 05:54

  本文选题:连续查询 + 隐私保护 ; 参考:《东南大学》2016年硕士论文


【摘要】:随着电子商务的繁荣以及移动设备的普及,基于位置的服务(Location-Based Services, LBS)得到了快速发展。基于位置服务能帮助人们快速准确地获取感兴趣的地理位置信息,在给人们带来极大便利的同时,不可避免的存在泄露使用者敏感信息(如位置、查询内容等)的风险。近年来,如何在保证用户隐私安全的同时提高LBS服务质量已成为数据库和信息安全领域的研究热点。本文对基于位置的连续查询隐私保护问题进行研究,主要工作如下:(1) 深入分析基于位置的连续查询环境下隐私保护的特点,探讨常见的攻击手段以及现有的隐私保护技术,归纳连续查询中主要隐私保护技术及目前存在的问题。(2) 提出基于方向优化的隐私保护连续k近邻查询方法,考虑用户运动方向对匿名区域和候选k近邻解集的影响,在服务器端生成并维护方向性优先MBR(Minimum Bounding Rectangle)队列,实现基于R树近邻查询的有效剪枝,在保护隐私安全的同时减少服务器计算量,提高查询效率。(3) 针对多数隐私保护连续查询方法依赖可信第三方导致可信第三方成为系统瓶颈问题,提出无可信约束的隐私保护连续查询方法,将凭据产生服务器引进查询系统,保障用户、匿名服务器、LBS服务器三者间信息交互的隐密性,匿名服务器有能力辨别真实用户与人工模拟用户从而免受DoS(Denial of Service)攻击,进一步改进匿名服务器处理流程,提高处理效率。对所提连续查询方法,设计实验进行分析,实验结果表明,所提方法是有效可行的。
[Abstract]:With the prosperity of e-commerce and the popularity of mobile devices, location-based services (LBSs) have developed rapidly. Location-based service can help people to obtain interesting geographic location information quickly and accurately. While it brings great convenience to people, there is an inevitable risk of revealing sensitive information (such as location, query content). In recent years, how to improve the quality of LBS service while ensuring user privacy security has become a hot topic in the field of database and information security. The main work of this paper is as follows: 1) analyzing the characteristics of privacy protection in location-based continuous query environment, and discussing the common attack methods and existing privacy protection techniques. The main privacy protection techniques and existing problems in continuous query are summarized. (2) A privacy preserving continuous k-nearest neighbor query method based on directional optimization is proposed. The influence of user motion direction on anonymous region and candidate k-nearest neighbor solution set is considered. At the server side, the directional priority MBRN minimum bounding Rectangle-based queue is generated and maintained, and the efficient pruning based on R-tree nearest neighbor query is realized, which can not only protect the privacy security but also reduce the computing load of the server. Improving query efficiency. (3) aiming at the bottleneck problem of trusted third party caused by reliance on trusted third party in most privacy preserving continuous query methods, an untrusted continuous privacy protection query method is proposed. The credential generating server is introduced into the query system to protect the confidentiality of information interaction among users, anonymous servers and LBS servers, and the anonymous server has the ability to distinguish between real users and artificial simulated users so as to avoid dos denial of Service attacks. Further improve the anonymous server processing process, improve processing efficiency. The experimental results show that the proposed method is effective and feasible.
【学位授予单位】:东南大学
【学位级别】:硕士
【学位授予年份】:2016
【分类号】:TP309

【参考文献】

相关期刊论文 前2条

1 倪巍伟;郑锦旺;崇志宏;;HilAnchor:Location Privacy Protection in the Presence of Users' Preferences[J];Journal of Computer Science & Technology;2012年02期

2 潘晓;郝兴;孟小峰;;基于位置服务中的连续查询隐私保护研究[J];计算机研究与发展;2010年01期



本文编号:2012970

资料下载
论文发表

本文链接:https://www.wllwen.com/jingjilunwen/dianzishangwulunwen/2012970.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户4a209***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com