基于维诺图的位置隐私最近邻查询方法
针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了-种抗 连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思想以及维诺图算法,在可信第三 方生成K-匿名集,用基于位置的服务（location based service, LBS）运营方服务器上存储的兴趣点（ point of interest, POI）划分维诺图,基于用户与POI之间的邻近关系生成关系矩阵;用K-匿名集生成的离散维诺图构成匿名空间, 以抵抗多查询攻击,保护用户位置隐私安全;用私有信息检索（ privacy information retrieval, PIR）技术保...
Saved in:
| Published in | 北京工业大学学报 Vol. 44; no. 2; pp. 225 - 233 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
北京工业大学信息学部,北京,100124
01.02.2018
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0254-0037 |
| DOI | 10.11936/bjutxb2017040016 |
Cover
| Abstract | 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了-种抗 连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思想以及维诺图算法,在可信第三 方生成K-匿名集,用基于位置的服务（location based service, LBS）运营方服务器上存储的兴趣点（ point of interest, POI）划分维诺图,基于用户与POI之间的邻近关系生成关系矩阵;用K-匿名集生成的离散维诺图构成匿名空间, 以抵抗多查询攻击,保护用户位置隐私安全;用私有信息检索（ privacy information retrieval, PIR）技术保护用户兴趣 点查询隐私的安全.在保证关系矩阵匿名度的同时,也确保了K-匿名集的用户查询位置语义的单-性,以不同的 维诺图划分集合,确保了l-多样性. |
|---|---|
| AbstractList | 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了-种抗 连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思想以及维诺图算法,在可信第三 方生成K-匿名集,用基于位置的服务（location based service, LBS）运营方服务器上存储的兴趣点（ point of interest, POI）划分维诺图,基于用户与POI之间的邻近关系生成关系矩阵;用K-匿名集生成的离散维诺图构成匿名空间, 以抵抗多查询攻击,保护用户位置隐私安全;用私有信息检索（ privacy information retrieval, PIR）技术保护用户兴趣 点查询隐私的安全.在保证关系矩阵匿名度的同时,也确保了K-匿名集的用户查询位置语义的单-性,以不同的 维诺图划分集合,确保了l-多样性. TP309; 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了一种抗连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思想以及维诺图算法,在可信第三方生成K-匿名集,用基于位置的服务(location based service,LBS)运营方服务器上存储的兴趣点(point of interest,POI)划分维诺图,基于用户与POI之间的邻近关系生成关系矩阵;用K-匿名集生成的离散维诺图构成匿名空间,以抵抗多查询攻击,保护用户位置隐私安全;用私有信息检索(privacy information retrieval,PIR)技术保护用户兴趣点查询隐私的安全.在保证关系矩阵匿名度的同时,也确保了K-匿名集的用户查询位置语义的单一性,以不同的维诺图划分集合,确保了l-多样性. |
| Abstract_FL | With the rapid development of location services, the problem of privacy disclosure in location queries is becoming more and more severe. A variety of privacy protection algorithms came into being. To overcome the shortcomings of K-anonymous, spatial anonymity, location blur and other privacy protection methods,a location nearest neighbor query method based on Voronoi Mapagainst continuous multi-query attacks was proposed. Based on the K-anonymous idea and the Voronoi Map algorithm, the K-user anonymous set was generated by the trusted third party,and the Vino diagram was divided by the point of interest ( POI) stored in the LBS server. The relationship matrix was generated by the distance between the user and the POI. The discrete Vino chart generated by the K-anonymous user set constituted an anonymous space to resist multi-query attacks and protected the user's location from privacy. User interest point query privacy was protected by private information retrieval technology. While ensuring the anonymity of the relation matrix, the singularity of the semantics of user and l-diversity was by dividing the set with different Vino diagrams. By the method, not only the privacy of location information and query information was ensured, but also the process of security, server-side security and the efficiency of the query were guaranteed. |
| Author | 周艺华;杜建航;杨宇光;侍伟敏 |
| AuthorAffiliation | 北京工业大学信息学部,北京100124 |
| AuthorAffiliation_xml | – name: 北京工业大学信息学部,北京,100124 |
| Author_FL | SHI Weimin YANG Yuguang ZHOU Yihua DU Jianhang |
| Author_FL_xml | – sequence: 1 fullname: ZHOU Yihua – sequence: 2 fullname: DU Jianhang – sequence: 3 fullname: YANG Yuguang – sequence: 4 fullname: SHI Weimin |
| Author_xml | – sequence: 1 fullname: 周艺华;杜建航;杨宇光;侍伟敏 |
| BookMark | eNotjz9Lw0AYxm-oYK39AK5uDtH3vbvc5UYp_oOCi87hEpPaoIm2FttNxVXRQYcqFARxs4MuplS_TJu038LDujzP8uP58SyQQpzEASFLCKuIiok1L2qdtT0KKIEDoCiQIlCbWwBMzpNys1n3ADhVEhkrEjbupaP0Nh98Tvrp-Ok7716Phjf58H3avcvfLrPni8nP_fRqkPVeJ_2X7PEr-3hYJHOhPmoG5f8ukf3Njb3KtlXd3dqprFctHxmCZasg1LYOhBcgDxXYIUdfo7HbSjqUcuWAoxizfU_6VARCUsNQhzOKTqgVK5GV2e65jkMd19woaTViY3S9qNY5aP-9dMAEGHZ5xvqHSVw7rRv6pFE_1o2OKySnAkAg-wUjombM |
| ClassificationCodes | TP309 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.11936/bjutxb2017040016 |
| DatabaseName | 中文期刊服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | Location Nearest Neighbor Query Method Based on Voronoi Map |
| DocumentTitle_FL | Location Nearest Neighbor Query Method Based on Voronoi Map |
| EndPage | 233 |
| ExternalDocumentID | bjgydxxb201802010 674260061 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目 funderid: (61572053) |
| GroupedDBID | -03 2B. 2C0 2RA 5XA 5XD 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CEKLB CQIGP CW9 P2P TCJ TGT U1G U5M W92 ~WA 4A8 93N ABJNI ADMLS PSX |
| ID | FETCH-LOGICAL-c1310-59efa5ae6be14f905f41ca1b00597822498089335cb7c26e67205f2843218fa93 |
| ISSN | 0254-0037 |
| IngestDate | Thu May 29 03:59:35 EDT 2025 Wed Feb 14 10:08:30 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 2 |
| Keywords | 基于位置服务 位置K-匿名 mobile communication private information retrieval privacy protection 随机匿名 隐私保护 私有信息检索 random anonymity location-based service 移动通信 location K-anonymous |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1310-59efa5ae6be14f905f41ca1b00597822498089335cb7c26e67205f2843218fa93 |
| Notes | ZHOU Yihua,DU Jianhang,YANG Yuguang,SHI Weimin （Faculty of Information Technology,Beijing University of Technology,Beijing 100124, China） 11-2286/T location-based service; location K- anonymous; mobile communication; privacy protection; private information retrieval; random anonymity With the rapid development of location services,the problem of privacy disclosure in location queries is becoming more and more severe. A variety of privacy protection algorithms came into being. To overcome the shortcomings of K- anonymous,spatial anonymity,location blur and other privacy protection methods,a location nearest neighbor query method based on Voronoi Mapagainst continuous multi-query attacks was proposed. Based on the K-anonymous idea and the Voronoi Map algorithm, the K-user anonymous set was generated by the trusted third party, and the Vino diagram was divided by the point of interest （ POI） stored in the LBS server. The relationship matrix was generated by the distance between the user and the POI. The discrete Vi |
| PageCount | 9 |
| ParticipantIDs | wanfang_journals_bjgydxxb201802010 chongqing_primary_674260061 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-02-01 |
| PublicationDateYYYYMMDD | 2018-02-01 |
| PublicationDate_xml | – month: 02 year: 2018 text: 2018-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | 北京工业大学学报 |
| PublicationTitleAlternate | Journal of Beijing Polytechnic University |
| PublicationTitle_FL | Journal of Beijing University of Technology |
| PublicationYear | 2018 |
| Publisher | 北京工业大学信息学部,北京,100124 |
| Publisher_xml | – name: 北京工业大学信息学部,北京,100124 |
| SSID | ssib004297133 ssib051370302 ssj0039890 ssib001129165 ssib002263171 |
| Score | 2.171623 |
| Snippet | 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了-种抗 连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-匿名思... TP309; 针对K-匿名、空间匿名、位置模糊等隐私保护方法易受推理攻击及连续多查询攻击的不足,提出了一种抗连续多查询攻击的基于维诺图的位置隐私最近邻查询算法.该算法基于K-... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 225 |
| SubjectTerms | 位置K-匿名 基于位置服务 私有信息检索 移动通信 随机匿名 隐私保护 |
| Title | 基于维诺图的位置隐私最近邻查询方法 |
| URI | http://lib.cqvip.com/qk/95054X/201802/674260061.html https://d.wanfangdata.com.cn/periodical/bjgydxxb201802010 |
| Volume | 44 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Inspec with Full Text issn: 0254-0037 databaseCode: ADMLS dateStart: 20180110 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text omitProxy: false ssIdentifier: ssj0039890 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV0_b9QwFLdO7QID4q8oBVQhPAaS2E7sMbnLqUKUhVbqdkpyyVUdrgXupNIJECsIBhgKUiUkxEYHWLiq8E2Y2rvrt-A9x5eLACFgiaz3Xuz3_Bz759h-JuQ6DOG83Y5jK5V-bHGexlYi7DYAuVjaOYOXdFCfpTve4gq_tSpWa7XvlV1L_V5yI93-7bmS__Eq0MCveEr2HzxbZgoESIN_4Qkehudf-ZhGgqomDQMacXzKiEY-DUMachpJGhQskAGKZimQ4Vq4QWVDCzdoACyFLGUjJfABXdLIo6qO2yAgn7BJlYMy0sXMkdWkgTBFBK6meDRUmAgZLe6znEBeVEDWqfKNkkEdKaGvcwCKxKKBEnAsGhOgkldJeFTCW2LSNLRBDg0kli-VMRGsAetZoV0DdcdCQs0FMdA0mHLxXYF2S12gFJgPcjnWE1YMJOpoJcoDt1n9OeLIyX7qsg-F-a-FMXaqHX4RcNI0bLfaexdnsA0QcIsIHb-OMUrfgpOs93tbiYvxhzgC5-mAWm5z9Hwd_x9n57MujDr2DJkNGku3704BK8Atp7LODGAYAJ1TRQu-MwXkwmHYQ5cB0piS5i-iMdOs26OKN39WEKOHrG10O_cAE-kjat087nYqaGr5NDllpkELQdGmz5Da9tpZcrISHPMcYUe7g8PB89H-5_He4OjN19HO08ODZ6ODj8c7L0YfHg_fPhp_e3n8ZH-4-3689274-svw06vzZKUZLdcXLXPFh5U6MLGwhMryWMSZl2QOz5Utcu6ksYNjg0LsypW0AVEzkSZ-6nqZ57sgA5CKATTNY8UukJnuRje7SBZi1vZtP8WF6IzHeNekyCVjXpZKOwPYP0fmS_Nbm0Uol1bpoTlyzVRIy3zgD1rJeudhe0tXobRx18ilP2YxT05Mm-BlMtO738-uAGLtJVeN238AwFZx8A |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E7%BB%B4%E8%AF%BA%E5%9B%BE%E7%9A%84%E4%BD%8D%E7%BD%AE%E9%9A%90%E7%A7%81%E6%9C%80%E8%BF%91%E9%82%BB%E6%9F%A5%E8%AF%A2%E6%96%B9%E6%B3%95&rft.jtitle=%E5%8C%97%E4%BA%AC%E5%B7%A5%E4%B8%9A%E5%A4%A7%E5%AD%A6%E5%AD%A6%E6%8A%A5&rft.au=%E5%91%A8%E8%89%BA%E5%8D%8E%3B%E6%9D%9C%E5%BB%BA%E8%88%AA%3B%E6%9D%A8%E5%AE%87%E5%85%89%3B%E4%BE%8D%E4%BC%9F%E6%95%8F&rft.date=2018-02-01&rft.issn=0254-0037&rft.volume=44&rft.issue=2&rft.spage=225&rft.epage=233&rft_id=info:doi/10.11936%2Fbjutxb2017040016&rft.externalDocID=674260061 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F95054X%2F95054X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fbjgydxxb%2Fbjgydxxb.jpg |