本文選題：連續(xù)查詢 + 隱私保護(hù)　； 參考：《東南大學(xué)》2016年碩士論文

【摘要】：隨著電子商務(wù)的繁榮以及移動(dòng)設(shè)備的普及,基于位置的服務(wù)(Location-Based Services, LBS)得到了快速發(fā)展�；谖恢梅⻊�(wù)能幫助人們快速準(zhǔn)確地獲取感興趣的地理位置信息,在給人們帶來極大便利的同時(shí),不可避免的存在泄露使用者敏感信息(如位置、查詢內(nèi)容等)的風(fēng)險(xiǎn)。近年來,如何在保證用戶隱私安全的同時(shí)提高LBS服務(wù)質(zhì)量已成為數(shù)據(jù)庫和信息安全領(lǐng)域的研究熱點(diǎn)。本文對(duì)基于位置的連續(xù)查詢隱私保護(hù)問題進(jìn)行研究,主要工作如下：(1) 深入分析基于位置的連續(xù)查詢環(huán)境下隱私保護(hù)的特點(diǎn),探討常見的攻擊手段以及現(xiàn)有的隱私保護(hù)技術(shù),歸納連續(xù)查詢中主要隱私保護(hù)技術(shù)及目前存在的問題。(2) 提出基于方向優(yōu)化的隱私保護(hù)連續(xù)k近鄰查詢方法,考慮用戶運(yùn)動(dòng)方向?qū)δ涿麉^(qū)域和候選k近鄰解集的影響,在服務(wù)器端生成并維護(hù)方向性優(yōu)先MBR(Minimum Bounding Rectangle)隊(duì)列,實(shí)現(xiàn)基于R樹近鄰查詢的有效剪枝,在保護(hù)隱私安全的同時(shí)減少服務(wù)器計(jì)算量,提高查詢效率。(3) 針對(duì)多數(shù)隱私保護(hù)連續(xù)查詢方法依賴可信第三方導(dǎo)致可信第三方成為系統(tǒng)瓶頸問題,提出無可信約束的隱私保護(hù)連續(xù)查詢方法,將憑據(jù)產(chǎn)生服務(wù)器引進(jìn)查詢系統(tǒng),保障用戶、匿名服務(wù)器、LBS服務(wù)器三者間信息交互的隱密性,匿名服務(wù)器有能力辨別真實(shí)用戶與人工模擬用戶從而免受DoS(Denial of Service)攻擊,進(jìn)一步改進(jìn)匿名服務(wù)器處理流程,提高處理效率。對(duì)所提連續(xù)查詢方法,設(shè)計(jì)實(shí)驗(yàn)進(jìn)行分析,實(shí)驗(yàn)結(jié)果表明,所提方法是有效可行的。
[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.
【學(xué)位授予單位】：東南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP309

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

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

2 潘曉;郝興;孟小峰;;基于位置服務(wù)中的連續(xù)查詢隱私保護(hù)研究[J];計(jì)算機(jī)研究與發(fā)展;2010年01期

，

本文編號(hào)：2012970