{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:01:37Z","timestamp":1774983697984,"version":"3.50.1"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202364,U21A20464,62372350,62402388"],"award-info":[{"award-number":["62202364,U21A20464,62372350,62402388"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB3106300"],"award-info":[{"award-number":["2023YFB3106300"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"fellowship of China National Postdoctoral Program for Innovation Talents","award":["BX20230279"],"award-info":[{"award-number":["BX20230279"]}]},{"name":"Shenzhen Science and Technology Program","award":["CJGJZD20220517142005013"],"award-info":[{"award-number":["CJGJZD20220517142005013"]}]},{"DOI":"10.13039\/501100006374","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2024M752534"],"award-info":[{"award-number":["2024M752534"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi","doi-asserted-by":"crossref","award":["2024GX-YBXM-075,2023-ZDLGY-52"],"award-info":[{"award-number":["2024GX-YBXM-075,2023-ZDLGY-52"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100018925","name":"'111 Center'","doi-asserted-by":"crossref","award":["B16037"],"award-info":[{"award-number":["B16037"]}],"id":[{"id":"10.13039\/501100018925","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>\n                    In recent years, the widely collected spatial-textual data has given rise to numerous applications centered on spatial keyword queries. However, securely providing spatial keyword query services in an outsourcing environment has been challenging. Existing schemes struggle to enable top-\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    spatial keyword queries on encrypted data while hiding search, access, and volume patterns, which raises concerns about availability and security. To address the above issue, this paper proposes OBIR-tree, a novel index structure for oblivious (provably hides search, access, and volume patterns) top-\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    spatial keyword queries on encrypted data. As a tight spatial-textual index tailored from the IR-tree and PathORAM, OBIR-tree can support sublinear search without revealing any useful information. Furthermore, we present extension designs to optimize the query latency of the OBIR-tree: (1) combine the OBIR-tree with hardware secure enclaves (\n                    <jats:italic toggle=\"yes\">e.g.,<\/jats:italic>\n                    Intel SGX) to minimize client-server interactions; (2) build a Real\/Dummy block Tree (RDT) to reduce the computational cost of oblivious operations within enclaves. Extensive experimental evaluations on real-world datasets demonstrate that the search efficiency of OBIR-tree outperforms state-of-the-art baselines by 25x ~ 723\u00d7 and is practical for real-world applications.\n                  <\/jats:p>","DOI":"10.1145\/3709708","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-24","source":"Crossref","is-referenced-by-count":5,"title":["OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0830-3823","authenticated-orcid":false,"given":"Zikai","family":"Ye","sequence":"first","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6420-8308","authenticated-orcid":false,"given":"Xiangyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0776-8839","authenticated-orcid":false,"given":"Zesen","family":"Liu","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3365-6757","authenticated-orcid":false,"given":"Dan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4251-1143","authenticated-orcid":false,"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"TrustZone: Integrated Hardware and Software Security. ARM White Paper\/ARM","author":"Alves T","year":"2004","unstructured":"T Alves. 2004. TrustZone: Integrated Hardware and Software Security. ARM White Paper\/ARM (2004)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30545-0_15"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_5_1","volume-title":"Leakage-Abuse Attacks Against Searchable Encryption. In ACM SIGSAC conference on computer and communications security. 668--679","author":"Cash David","year":"2015","unstructured":"David Cash, Paul Grubbs, Jason Perry, and Thomas Ristenpart. 2015. Leakage-Abuse Attacks Against Searchable Encryption. In ACM SIGSAC conference on computer and communications security. 668--679."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3060757"},{"key":"e_1_2_1_7_1","volume-title":"Towards Practical Oblivious Join. In ACM SIGMOD International Conference on Management of Data. 803--817","author":"Chang Zhao","year":"2022","unstructured":"Zhao Chang, Dong Xie, Sheng Wang, and Feifei Li. 2022b. Towards Practical Oblivious Join. In ACM SIGMOD International Conference on Management of Data. 803--817."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3310038"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_2_1_10_1","volume-title":"When Geo-Text Meets Security: Privacy-Preserving Boolean Spatial Keyword Queries. In IEEE International Conference on Data Engineering. 1046--1057","author":"Cui Ningning","year":"2019","unstructured":"Ningning Cui, Jianxin Li, Xiaochun Yang, Bin Wang, Mark Reynolds, and Yong Xiang. 2019. When Geo-Text Meets Security: Privacy-Preserving Boolean Spatial Keyword Queries. In IEEE International Conference on Data Engineering. 1046--1057."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236218"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364331"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3456631"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"e_1_2_1_15_1","volume-title":"New Constructions for Forward and Backward Private Symmetric Searchable Encryption. In ACM SIGSAC Conference on Computer and Communications Security. 1038--1055","author":"Chamani Javad Ghareh","year":"2018","unstructured":"Javad Ghareh Chamani, Dimitrios Papadopoulos, Charalampos Papamanthou, and Rasool Jalili. 2018. New Constructions for Forward and Backward Private Symmetric Searchable Encryption. In ACM SIGSAC Conference on Computer and Communications Security. 1038--1055."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243864"},{"key":"e_1_2_1_18_1","volume-title":"Rethinking Searchable Symmetric Encryption. In IEEE Symposium on Security and Privacy. 1401--1418","author":"Gui Zichen","year":"2023","unstructured":"Zichen Gui, Kenneth G Paterson, and Sikhar Patranabis. 2023. Rethinking Searchable Symmetric Encryption. In IEEE Symposium on Security and Privacy. 1401--1418."},{"key":"e_1_2_1_19_1","volume-title":"Attack and Mitigation. In Annual Network and Distributed System Security Symposium","volume":"20","author":"Islam Mohammad Saiful","year":"2012","unstructured":"Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In Annual Network and Distributed System Security Symposium, Vol. 20. 12."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407814"},{"key":"e_1_2_1_22_1","volume-title":"Result Pattern Hiding Searchable Encryption for Conjunctive Queries. In ACM SIGSAC Conference on Computer and Communications Security. 745--762","author":"Lai Shangqi","year":"2018","unstructured":"Shangqi Lai, Sikhar Patranabis, Amin Sakzad, Joseph K. Liu, Debdeep Mukhopadhyay, Ron Steinfeld, Shifeng Sun, Dongxi Liu, and Cong Zuo. 2018. Result Pattern Hiding Searchable Encryption for Conjunctive Queries. In ACM SIGSAC Conference on Computer and Communications Security. 745--762."},{"key":"e_1_2_1_23_1","volume-title":"Insecurity and Hardness of Nearest Neighbor Queries Over Encrypted Data. In IEEE International Conference on Data Engineering. 1614--1617","author":"Li Rui","year":"2019","unstructured":"Rui Li, Alex X Liu, Ying Liu, Huanle Xu, and Huaqiang Yuan. 2019. Insecurity and Hardness of Nearest Neighbor Queries Over Encrypted Data. In IEEE International Conference on Data Engineering. 1614--1617."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_25_1","volume-title":"Oblix: An Efficient Oblivious Search Index. In IEEE Symposium on Security and Privacy. 279--296","author":"Mishra Pratyush","year":"2018","unstructured":"Pratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa, and Raluca Ada Popa. 2018. Oblix: An Efficient Oblivious Search Index. In IEEE Symposium on Security and Privacy. 279--296."},{"key":"e_1_2_1_26_1","volume-title":"Fast Database Joins and PSI for Secret Shared Data. In ACM SIGSAC Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). 1271--1287","author":"Mohassel Payman","year":"2020","unstructured":"Payman Mohassel, Peter Rindal, and Mike Rosulek. 2020. Fast Database Joins and PSI for Secret Shared Data. In ACM SIGSAC Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). 1271--1287."},{"key":"e_1_2_1_27_1","volume-title":"USENIX Security Symposium. 127--142","author":"Oya Simon","year":"2021","unstructured":"Simon Oya and Florian Kerschbaum. 2021. Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable Encryption. In USENIX Security Symposium. 127--142."},{"key":"e_1_2_1_28_1","volume-title":"Oblivious RAM Revisited. In Annual International Cryptology Conference. 502--519","author":"Pinkas Benny","year":"2010","unstructured":"Benny Pinkas and Tzachy Reinman. 2010. Oblivious RAM Revisited. In Annual International Cryptology Conference. 502--519."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3625054.3625055"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.357"},{"key":"e_1_2_1_31_1","volume-title":"Data Security and Privacy for Outsourced Data in the Cloud. In IEEE International Conference on Data Engineering. 1731--1734","author":"Sahin Cetin","year":"2018","unstructured":"Cetin Sahin and Amr El Abbadi. 2018. Data Security and Privacy for Outsourced Data in the Cloud. In IEEE International Conference on Data Engineering. 1731--1734."},{"key":"e_1_2_1_32_1","volume-title":"Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In IEEE Symposium on Security and Privacy. 842--858","author":"Shi Elaine","year":"2020","unstructured":"Elaine Shi. 2020. Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In IEEE Symposium on Security and Privacy. 842--858."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18120-2_34"},{"key":"e_1_2_1_35_1","first-page":"796","article-title":"Privacy-Preserving Top-k Spatial Keyword Queries in Untrusted Cloud Environments","volume":"11","author":"Su Sen","year":"2018","unstructured":"Sen Su, Yiping Teng, Xiang Cheng, Ke Xiao, Guoliang Li, and JunLiang Chen. 2018. Privacy-Preserving Top-k Spatial Keyword Queries in Untrusted Cloud Environments. IEEE Transactions on Services Computing, Vol. 11, 5 (2018), 796--809.","journal-title":"IEEE Transactions on Services Computing"},{"key":"e_1_2_1_36_1","volume-title":"EnigMap: External-Memory Oblivious Map for Secure Enclaves. In USENIX Security Symposium. 4033--4050","author":"Tinoco Afonso","year":"2023","unstructured":"Afonso Tinoco, Sixiang Gao, and Elaine Shi. 2023. EnigMap: External-Memory Oblivious Map for Secure Enclaves. In USENIX Security Symposium. 4033--4050."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3152168"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3134711"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2023.9010158"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3118880"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155505"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3205670"},{"key":"e_1_2_1_43_1","volume-title":"Oblivious Data Structures. In ACM SIGSAC Conference on Computer and Communications Security. 215--226","author":"Wang Xiao Shaun","year":"2014","unstructured":"Xiao Shaun Wang, Kartik Nayak, Chang Liu, TH Hubert Chan, Elaine Shi, Emil Stefanov, and Yan Huang. 2014. Oblivious Data Structures. In ACM SIGSAC Conference on Computer and Communications Security. 215--226."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0271-0"},{"key":"e_1_2_1_46_1","volume-title":"OBI: A Multi-path Oblivious RAM for Forward-and-backward-secure Searchable Encryption. In Annual Network and Distributed System Security Symposium.","author":"Wu Zhiqiang","year":"2023","unstructured":"Zhiqiang Wu and Rui Li. 2023. OBI: A Multi-path Oblivious RAM for Forward-and-backward-secure Searchable Encryption. In Annual Network and Distributed System Security Symposium."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3292379"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:19:49Z","timestamp":1774981189000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709708"],"URL":"https:\/\/doi.org\/10.1145\/3709708","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}