{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:27Z","timestamp":1740142767232,"version":"3.37.3"},"reference-count":52,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872289","61872152","61602287"],"award-info":[{"award-number":["61872289","61872152","61602287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS201714"],"award-info":[{"award-number":["GCIS201714"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>As a prominent cryptographic tool, geometric searchable encryption (GSE) can be applied in many scenarios, such as location-based services (LBS), social networks and vehicle networks. Unfortunately, most of existing searchable encryption schemes supporting the functionality of geometric range searches suffer from false positives, which will lead people to make a wrong decision and further raise some serious consequences such as financial loss. In addition, some of them are designed under a symmetric system, which is not enough flexible deployed in LBS since in a symmetric system only a private key holder creates ciphertext, whereas in a public-key system anyone who holds a public key can produce ciphertext. In this paper, we intend to design a novel GSE scheme without any false positive under a public-key system supporting arbitrary geometric area searches, which is able to guarantee an accurate query result. Toward this goal, we develop a novel technique in handling the relation between a point and any convex polygon in combination with an inner product encryption, which is able to support arbitrary convex polygon range searches without any false positive. A comprehensive experiment demonstrates that, compared with the known schemes, our scheme possesses a 100% accuracy as well as an acceptable efficiency in the sense that it can guarantee that all files retrieved by users are exactly matched ones. Finally, we provide two practical examples of our GSE scheme: privacy-preserving friend-nearby notification with a common point of interest and privacy-preserving parking monitor and guiding system.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac067","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T11:32:13Z","timestamp":1652268733000},"page":"2155-2168","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Searchable Encryption Without False Positive And Its Applications"],"prefix":"10.1093","volume":"66","author":[{"given":"Zhenhua","family":"Chen","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an 710054 , China"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology , Guilin 541004 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Nie","sequence":"additional","affiliation":[{"name":"College of Safety Science and Engineering, Xi\u2019an University of Science and Technology , Xi\u2019an 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an 710054 , China"},{"name":"College of Safety Science and Engineering, Xi\u2019an University of Science and Technology , Xi\u2019an 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunpeng","family":"Ge","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics , Nanjing 211106 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[{"name":"School of Computing and Information Technology, University of Wollongong , Wollongong, NSW 2500 , Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"2023091720460635000_ref1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"A new approach to query-answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"2023091720460635000_ref2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/223\/03131","article-title":"Geometric range searching and its relatives","volume":"223","author":"Agarwal","year":"1999","journal-title":"Contemporary Mathematics"},{"key":"2023091720460635000_ref3","first-page":"1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, San Diego, USA, 6\u20139 February","author":"Narayanan","year":"2011"},{"key":"2023091720460635000_ref4","first-page":"1","article-title":"Mad-rappel: mobility aware data replacement and prefetching policy enrooted LBS","volume":"32","author":"Gupta","year":"2020","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"2023091720460635000_ref5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.patrec.2018.05.015","article-title":"Move, attend and predict: an attention-based neural model for people\u2019s movement prediction","volume":"112","author":"Al-Molegi","year":"2020","journal-title":"Pattern Recognit. Lett."},{"key":"2023091720460635000_ref6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.pmcj.2018.05.001","article-title":"Regions-of-interest discovering and predicting in smartphone environments","volume":"47","author":"Al-Molegi","year":"2018","journal-title":"Pervasive Mob. Comput."},{"key":"2023091720460635000_ref7","doi-asserted-by":"crossref","first-page":"23457","DOI":"10.1109\/ACCESS.2020.2969270","article-title":"A public psychological pressure index for social networks","volume":"8","author":"Zhang","year":"2020","journal-title":"IEEE Access"},{"key":"2023091720460635000_ref8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.procs.2020.03.117","article-title":"Cultural algorithms for cluster hires in social networks","volume":"170","author":"Selvarajah","year":"2020","journal-title":"Procedia Computer Science"},{"key":"2023091720460635000_ref9","doi-asserted-by":"crossref","first-page":"5721","DOI":"10.1007\/s12652-020-01947-7","article-title":"Inter-vehicle distance-based location aware multi-hop routing in vehicular ad-hoc network","volume":"11","author":"Rana","year":"2020","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"2023091720460635000_ref10","first-page":"44","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy, Berkeley, USA, 14\u201317 May","author":"Song","year":"2000"},{"key":"2023091720460635000_ref11","first-page":"506","volume-title":"Proceedings of the Theory and Applications of Cryptographic Techniques, Interlaken, CH, 2\u20136 May","author":"Boneh","year":"2004"},{"key":"2023091720460635000_ref12","first-page":"73","volume-title":"Proceedings of the Information Security Applications, Jeju Island, KOR, 23\u201325 August","author":"Park","year":"2004"},{"key":"2023091720460635000_ref13","first-page":"535","volume-title":"Proceedings of the Theory of Cryptography Conference, Amsterdam, NL, 21\u201324 February","author":"Boneh","year":"2007"},{"key":"2023091720460635000_ref14","first-page":"146","volume-title":"Proceedings of the Theory and Applications of Cryptographic Techniques, Cambridge, GB, 13\u201317 April","author":"Katz","year":"2008"},{"key":"2023091720460635000_ref15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10623-010-9405-9","article-title":"Inner-product encryption under standard assumptions","volume":"58","author":"Park","year":"2011","journal-title":"Designs, Codes and Cryptography"},{"key":"2023091720460635000_ref16","first-page":"243","volume-title":"Proceedings of the Information, Computer and Communications Security, Hangzhou, CHN, 8\u201310 May","author":"Lai","year":"2013"},{"key":"2023091720460635000_ref17","first-page":"123","volume-title":"Proceedings of the P2P, Parallel, Grid, Cloud and Internet Computing, Asan, KOR, 5\u20137 November","author":"Xiao","year":"2016"},{"key":"2023091720460635000_ref18","first-page":"321","volume-title":"Proceedings of the Data and Application Security and Privacy, San Antonio Texas, USA, 3\u20135 March","author":"Ghinita","year":"2014"},{"key":"2023091720460635000_ref19","first-page":"182","volume-title":"Proceedings of the Communications and Network Security, Florence, IT, 28\u201330 September","author":"Wang","year":"2015"},{"key":"2023091720460635000_ref20","doi-asserted-by":"crossref","first-page":"7729","DOI":"10.1109\/TVT.2015.2499791","article-title":"An efficient privacy-preserving location-based services query scheme in outsourced cloud","volume":"65","author":"Zhu","year":"2015","journal-title":"IEEE Trans. Veh. Technol."},{"key":"2023091720460635000_ref21","first-page":"1","article-title":"Quantum search on encrypted data based on quantum homomorphic encryption","volume":"10","author":"Zhou","year":"2020","journal-title":"Sci. Rep."},{"key":"2023091720460635000_ref22","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/TIFS.2015.2506145","article-title":"Geometric range search on encrypted spatial data","volume":"11","author":"Wang","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2023091720460635000_ref23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","article-title":"Theory and practice of bloom filters for distributed systems","volume":"14","author":"Tarkoma","year":"2011","journal-title":"IEEE Communications Survey and Tutorials"},{"key":"2023091720460635000_ref24","first-page":"457","volume-title":"Proceedings of the Theory of Cryptography, San Francisco, USA, 15\u201317 March","author":"Shen","year":"2009"},{"key":"2023091720460635000_ref25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/TDSC.2017.2684802","article-title":"Fastgeo: efficient geometric range queries on encrypted spatial data","volume":"16","author":"Wang","year":"2017","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"2023091720460635000_ref26","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/s13042-019-01026-0","article-title":"Weighted multi-deep ranking supervised hashing for efficient image retrieval","volume":"11","author":"Li","year":"2019","journal-title":"International Journal of Machine Learning and Cybernetics"},{"key":"2023091720460635000_ref27","first-page":"464","article-title":"Quantum attacks on Sum of Even-Mansour pseudorandom functions","volume":"173","author":"Shinagawa","year":"2020","journal-title":"Information Processing Letters"},{"key":"2023091720460635000_ref28","first-page":"1","volume-title":"Proceedings of the Quality of Service, Vilanova i la Geltr, ES, 14\u201316 June","author":"Luo","year":"2017"},{"key":"2023091720460635000_ref29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02187685","article-title":"Halfspace range search: An algorithmic application ofk-sets","volume":"1","author":"Chazelle","year":"1986","journal-title":"Discrete and Computational Geometry"},{"key":"2023091720460635000_ref30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-70997-8","volume-title":"Geometry revealed: a Jacob\u2019s ladder to modern higher geometry","author":"Berger","year":"2010"},{"key":"2023091720460635000_ref31","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1109\/TNNLS.2017.2673241","article-title":"Efficient knn classification with different numbers of nearest neighbors","volume":"5","author":"Zhang","year":"2018","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"2023091720460635000_ref32","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":"Xu","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"volume-title":"Automatic Trend Estimation","year":"2012","author":"Vamos","key":"2023091720460635000_ref33"},{"key":"2023091720460635000_ref34","first-page":"656","volume-title":"Proceedings of the Computer and Communications Security, Denver Colorado, USA, 12\u201316 October","author":"Kerschbaum","year":"2015"},{"key":"2023091720460635000_ref35","first-page":"75","volume-title":"Proceedings of 3th VLDB Workshop, SDM 2006, Seoul, Korea, 10\u201311 September","author":"Byun","year":"2006"},{"key":"2023091720460635000_ref36","first-page":"100","volume-title":"Proceedings of the Secure Data Management, Oslo, NOR, 23\u201325 June","author":"Yau","year":"2008"},{"key":"2023091720460635000_ref37","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TIFS.2014.2378592","article-title":"Efficient public key encryption with equality test supporting flexible authorization","volume":"10","author":"Ma","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2023091720460635000_ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","article-title":"An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks","volume":"403","author":"Huang","year":"2017","journal-title":"Inform. Sci."},{"key":"2023091720460635000_ref39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/7254305","article-title":"A Secure ciphertext retrieval scheme against insider KGAs for mobile devices in cloud storage","volume":"2018","author":"Xie","year":"2018","journal-title":"Security and Communication Networks"},{"key":"2023091720460635000_ref40","first-page":"213","volume-title":"Proceedings of the Advances in Cryptology, Santa Barbara, USA, 19\u201323 August","author":"Boneh","year":"2001"},{"key":"2023091720460635000_ref41","first-page":"114","volume-title":"Proceedings of the Theory and Applications of Cryptographic Techniques, Aarhus, DA, 22\u201326 May","author":"Waters","year":"2005"},{"key":"2023091720460635000_ref42","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0098-3004(96)00071-4","article-title":"On the complexity of point-in-polygon algorithms","volume":"23","author":"Huang","year":"1997","journal-title":"Comput. Geosci."},{"key":"2023091720460635000_ref43","first-page":"290","volume-title":"Proceedings of the Advances in Cryptology, Santa Barbara, USA, 20\u201324 August","author":"Boyen","year":"2006"},{"key":"2023091720460635000_ref44","first-page":"1","article-title":"Dynamic and scalable virtual machine placement algorithm for mitigating side channel attacks in cloud computing","volume":"34","author":"Gali","year":"2021","journal-title":"Materials Today: Proceedings"},{"key":"2023091720460635000_ref45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comnet.2021.108409","article-title":"Efficient side-channel attacks beyond divide-and-conquer strategy","volume":"198","author":"Jin","year":"2021","journal-title":"Comput. Networks"},{"key":"2023091720460635000_ref46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2020.106663","article-title":"HANMRE-An authenticated encryption secure against side-channel attacks for nonce-misuse and light weight approaches","volume":"97","author":"Tran","year":"2020","journal-title":"Applied Soft Computing Journal"},{"key":"2023091720460635000_ref47","first-page":"353","volume-title":"Proceedings of the IEEE High Assurance Systems Engineering Symposium, Nanjing, CHN, 3\u20135 December","author":"Pongaliur","year":"2008"},{"key":"2023091720460635000_ref48","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TDSC.2016.2610966","article-title":"Hardware architecture implemented on FPGA for protecting cryptographic keys against side-channel attacks","volume":"15","author":"Lumbiarres-Lopez","year":"2016","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"2023091720460635000_ref49","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.enganabound.2019.06.005","article-title":"Boundary moving least square method for 2D elasticity problems","volume":"106","author":"Huang","year":"2019","journal-title":"Eng. Anal. Bound. Elem."},{"key":"2023091720460635000_ref50","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01934125","article-title":"Computer cartography point in polygons programs","volume":"7","author":"Nordbeck","year":"1967","journal-title":"BIT Numerical Mathematics"},{"key":"2023091720460635000_ref51","first-page":"41","volume-title":"Proceedings of the Advances in Cryptology, Santa Barbara, USA, 15\u201319 August","author":"Boneh","year":"2004"},{"key":"2023091720460635000_ref52","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Proceedings of the Theory of Cryptography, Cambridge, USA, 10\u201312 February","author":"Boneh","year":"2005"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/9\/2155\/51643539\/bxac067.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/9\/2155\/51643539\/bxac067.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T21:09:17Z","timestamp":1694984957000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/9\/2155\/6608476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":52,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,6,15]]},"published-print":{"date-parts":[[2023,9,18]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac067","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,9]]},"published":{"date-parts":[[2022,6,15]]}}}