{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:43:49Z","timestamp":1740149029866,"version":"3.37.3"},"reference-count":30,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61960206014","MMJJ20180110"],"award-info":[{"award-number":["61960206014","MMJJ20180110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013838","name":"National Crypto Development Foundation","doi-asserted-by":"publisher","award":["61960206014","MMJJ20180110"],"award-info":[{"award-number":["61960206014","MMJJ20180110"]}],"id":[{"id":"10.13039\/501100013838","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,9,25]]},"abstract":"<jats:p>Group nearest neighbor (GNN) query enables a group of location-based service (LBS) users to retrieve a point from point of interests (POIs) with the minimum aggregate distance to them. For resource constraints and privacy concerns, LBS provider outsources the encrypted POIs to a powerful cloud server. The encryption-and-outsourcing mechanism brings a challenge for the data utilization. However, as previous work from <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>k<\/a:mi>\n                        <a:mo>\u2212<\/a:mo>\n                     <\/a:math>\n                  <\/jats:inline-formula>anonymity technique leaks all contents of POIs and returns an answer set with redundant communication cost, the LBS system cannot work properly with those privacy-preserving schemes. In this paper, we illustrate a secure group nearest neighbor query scheme, which is referred to as SecGNN. It supports the GNN query with <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <c:mi>n<\/c:mi>\n                        <c:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <c:mrow>\n                              <c:mi>n<\/c:mi>\n                              <c:mo>\u2265<\/c:mo>\n                              <c:mn>3<\/c:mn>\n                           <\/c:mrow>\n                        <\/c:mfenced>\n                     <\/c:math>\n                  <\/jats:inline-formula> LBS users and assures the data privacy and query privacy. Since SecGNN only achieves linear search complexity, an efficiency enhanced scheme (named Sec<jats:inline-formula>\n                     <h:math xmlns:h=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <h:msup>\n                           <h:mrow>\n                              <h:mtext>GNN<\/h:mtext>\n                           <\/h:mrow>\n                           <h:mrow>\n                              <h:mo>+<\/h:mo>\n                           <\/h:mrow>\n                        <\/h:msup>\n                     <\/h:math>\n                  <\/jats:inline-formula>) is introduced by taking advantage of the KD-tree data structure. Specifically, we convert the GNN problem to the nearest neighbor problem for their centroid, which can be computed by anonymous veto network and Burmester\u2013Desmedt conference key agreement protocols. Furthermore, the Sec<jats:inline-formula>\n                     <j:math xmlns:j=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <j:msup>\n                           <j:mrow>\n                              <j:mtext>GNN<\/j:mtext>\n                           <\/j:mrow>\n                           <j:mrow>\n                              <j:mo>+<\/j:mo>\n                           <\/j:mrow>\n                        <\/j:msup>\n                     <\/j:math>\n                  <\/jats:inline-formula> scheme is introduced from the KD-tree data structure and a designed tool, which supports the computation of inner products over ciphertexts. Finally, we run experiments on a real-database and a random database to evaluate the performance of our SecGNN and Sec<jats:inline-formula>\n                     <l:math xmlns:l=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <l:msup>\n                           <l:mrow>\n                              <l:mtext>GNN<\/l:mtext>\n                           <\/l:mrow>\n                           <l:mrow>\n                              <l:mo>+<\/l:mo>\n                           <\/l:mrow>\n                        <\/l:msup>\n                     <\/l:math>\n                  <\/jats:inline-formula> schemes. The experimental results show the high efficiency of our proposed schemes.<\/jats:p>","DOI":"10.1155\/2021\/5686506","type":"journal-article","created":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T18:20:14Z","timestamp":1632594014000},"page":"1-17","source":"Crossref","is-referenced-by-count":2,"title":["Secure and Practical Group Nearest Neighbor Query for Location-Based Services in Cloud Computing"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6280-896X","authenticated-orcid":true,"given":"Jingjing","family":"Guo","sequence":"first","affiliation":[{"name":"Jingjing Guo was with the State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1953-0178","authenticated-orcid":true,"given":"Jiacong","family":"Sun","sequence":"additional","affiliation":[{"name":"Jiacong Sun was with School of Electronic and Computer Engineering, Peking University Shenzhen Graduate School, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2019.2923156"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2018.2831199"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2982636"},{"first-page":"29","article-title":"Providing database as a service","author":"H. Hacig\u00fcm\u00fcs","key":"4"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739100"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0809-0"},{"first-page":"277","article-title":"Privacy preserving group nearest neighbor search","author":"Y. Wu","key":"7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2930696"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367531"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/infocom.2016.7524389"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2989433"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/glocom.2010.5683308"},{"key":"14","first-page":"1857","article-title":"Preserving location privacy for a group of users","volume":"21","author":"M. Ashouritalouki","year":"2013","journal-title":"Turkish Journal of Electrical Engineering and Computer Sciences"},{"first-page":"139","article-title":"Secure knn computation on encrypted databases","author":"W. K Wong","key":"15"},{"first-page":"301","article-title":"Group nearest neighbor queries","author":"D. Papadias","key":"16"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.04.019"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11593-1_20"},{"key":"20","first-page":"165","article-title":"Efficient public-key cryptosystems provably secure against active adversaries","volume-title":"Advances in Cryptology - ASIACRYPT \u201999, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings, Volume 1716 of Lecture Notes in Computer Science","author":"P. Pascal","year":"1999"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1768-2"},{"first-page":"202","article-title":"A 2-round anonymous veto protocol","author":"H. Feng","key":"22"},{"key":"23","first-page":"41","article-title":"The power of anonymous veto in public discussion","volume":"4","author":"H. Feng","year":"2009","journal-title":"Transaction Computer Science"},{"first-page":"275","article-title":"A secure and efficient conference key distribution system (extended abstract)","author":"M. Burmester","key":"24"},{"key":"25","article-title":"Protocols for authentication and key establishment","volume-title":"Information Security and Cryptography","author":"C. Boyd","year":"2020","edition":"2nd"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2016.2553083"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2018.09.005"},{"issue":"4","key":"28","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TIFS.2018.2868162","article-title":"Enabling efficient and geometric range query with access control over encrypted spatial data","volume":"14","author":"G. Xu","year":"2018","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.2983030"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1978.1055817"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5686506.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5686506.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5686506.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T18:20:24Z","timestamp":1632594024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/5686506\/"}},"subtitle":[],"editor":[{"given":"AnMin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,9,25]]},"references-count":30,"alternative-id":["5686506","5686506"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5686506","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,9,25]]}}}