{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T02:47:03Z","timestamp":1768704423810,"version":"3.49.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T00:00:00Z","timestamp":1696291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62125205, 62072361"],"award-info":[{"award-number":["62125205, 62072361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi","doi-asserted-by":"crossref","award":["2023KXJ-190"],"award-info":[{"award-number":["2023KXJ-190"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["XJSJ23188, YJSJ23007"],"award-info":[{"award-number":["XJSJ23188, YJSJ23007"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2023,11,30]]},"abstract":"<jats:p>\n            Symmetric Searchable Encryption (SSE), as an ideal primitive, can ensure data privacy while supporting retrieval over encrypted data. However, existing multi-user SSE schemes require the data owner to share the secret key with all query users or always be online to generate search tokens. While there are some solutions to this problem, they have at least one weakness, such as non-supporting conjunctive query, result decryption assistance of the data owner, and unauthorized access. To solve the above issues, we propose an\n            <jats:underline>O<\/jats:underline>\n            wner-free\n            <jats:underline>Di<\/jats:underline>\n            stributed\n            <jats:underline>S<\/jats:underline>\n            ymmetric searchable encryption supporting\n            <jats:underline>C<\/jats:underline>\n            onjunctive query (ODiSC). Specifically, we first evaluate the Learning-Parity-with-Noise weak Pseudorandom Function (LPN-wPRF) in dual-cloud architecture to generate search tokens with the data owner free from sharing key and being online. Then, we provide fine-grained conjunctive query in the distributed architecture using additive secret sharing and symmetric-key hidden vector encryption. Finally, formal security analysis and empirical performance evaluation demonstrate that ODiSC is adaptively simulation-secure and efficient.\n          <\/jats:p>","DOI":"10.1145\/3607255","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T12:22:22Z","timestamp":1688559742000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Owner-free Distributed Symmetric Searchable Encryption Supporting Conjunctive Queries"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4715-5627","authenticated-orcid":false,"given":"Qiuyun","family":"Tong","sequence":"first","affiliation":[{"name":"School of Cyber Engineering, Xidian University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5583-4155","authenticated-orcid":false,"given":"Xinghua","family":"Li","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University, China and Engineering Research Center of Big data Security, Ministry of Education, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5437-3572","authenticated-orcid":false,"given":"Yinbin","family":"Miao","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7411-4348","authenticated-orcid":false,"given":"Yunwei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4238-3295","authenticated-orcid":false,"given":"Ximeng","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3491-8146","authenticated-orcid":false,"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Information Systems, Singapore Management University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,3]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"1811","volume-title":"Proc. USENIX Security Symposium (USENIX\u201921)","author":"Ali Asra","year":"2021","unstructured":"Asra Ali, Tancrede Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication\u2013computation trade-offs in PIR. In Proc. USENIX Security Symposium (USENIX\u201921). 1811\u20131828."},{"key":"e_1_3_2_3_2","first-page":"420","volume-title":"Proc. Annual International Cryptology Conference (CRYPTO\u201991)","author":"Beaver Donald","year":"1991","unstructured":"Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Proc. Annual International Cryptology Conference (CRYPTO\u201991). Springer, 420\u2013432."},{"key":"e_1_3_2_4_2","first-page":"192","volume-title":"Proc. European Symposium on Research in Computer Security (ESORICS\u201908)","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A framework for fast privacy-preserving computations. In Proc. European Symposium on Research in Computer Security (ESORICS\u201908). Springer, 192\u2013206."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/978-3-030-03810-6_25","volume-title":"Proc. Theory of Cryptography Conference (TCC\u201918)","volume":"11240","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Yuval Ishai, Alain Passel\u00e8gue, Amit Sahai, and David Wu. 2018. Exploring crypto dark matter: New simple PRF candidates and their applications. In Proc. Theory of Cryptography Conference (TCC\u201918), Vol. 11240. Springer, 699\u2013729."},{"key":"e_1_3_2_7_2","first-page":"1","article-title":"Dynamic searchable encryption in very-large databases: Data structures and implementation","author":"Cash David","year":"2014","unstructured":"David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-C\u01cet\u01celin Ro\u015fu, and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. Proc. Annual Network and Distributed System Security Symposium (NDSS\u201914) (2014), 1\u201316.","journal-title":"Proc. Annual Network and Distributed System Security Symposium (NDSS\u201914)"},{"key":"e_1_3_2_8_2","first-page":"353","volume-title":"Proc. Annual Cryptology Conference (CRYPTO\u201913)","author":"Cash David","year":"2013","unstructured":"David Cash, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-C\u0103t\u0103lin Ro\u015fu, and Michael Steiner. 2013. Highly-scalable searchable symmetric encryption with support for boolean queries. In Proc. Annual Cryptology Conference (CRYPTO\u201913). Springer, 353\u2013373."},{"key":"e_1_3_2_9_2","first-page":"237","volume-title":"Proc. Asia Conference on Computer and Communications Security (AsiaCCS\u201918)","author":"Cheng Ke","year":"2018","unstructured":"Ke Cheng, Yantian Hou, and Liangmin Wang. 2018. Secure similar sequence query on outsourced genomic data. In Proc. Asia Conference on Computer and Communications Security (AsiaCCS\u201918). ACM, 237\u2013251."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.03.043"},{"key":"e_1_3_2_11_2","first-page":"79","volume-title":"Proc. ACM Conference on Computer and Communications Security (CCS\u201906)","author":"Curtmola Reza","year":"2006","unstructured":"Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. 2006. Searchable symmetric encryption: Improved definitions and efficient constructions. In Proc. ACM Conference on Computer and Communications Security (CCS\u201906). ACM, 79\u201388."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_3_2_13_2","first-page":"1","volume-title":"Proc. Annual Network and Distributed System Security Symposium (NDSS\u201915)","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY-A framework for efficient mixed-protocol secure two-party computation. In Proc. Annual Network and Distributed System Security Symposium (NDSS\u201915). The Internet Society, 1\u201315."},{"key":"e_1_3_2_14_2","first-page":"517","volume-title":"Proc. Annual International Cryptology Conference (CRYPTO\u201921)","author":"Dinur Itai","year":"2021","unstructured":"Itai Dinur, Steven Goldfeder, Tzipora Halevi, Yuval Ishai, Mahimna Kelkar, Vivek Sharma, and Greg Zaverucha. 2021. MPC-friendly symmetric cryptography from alternating moduli: Candidates, protocols, and applications. In Proc. Annual International Cryptology Conference (CRYPTO\u201921). Springer, 517\u2013547."},{"key":"e_1_3_2_15_2","first-page":"875","volume-title":"Proc. ACM SIGSAC Conference on Computer & Communications Security (CCS\u201913)","author":"Jarecki Stanislaw","year":"2013","unstructured":"Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel Rosu, and Michael Steiner. 2013. Outsourced symmetric private information retrieval. In Proc. ACM SIGSAC Conference on Computer & Communications Security (CCS\u201913). ACM, 875\u2013888."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2950934"},{"key":"e_1_3_2_17_2","first-page":"745","volume-title":"Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201918)","author":"Lai Shangqi","year":"2018","unstructured":"Shangqi Lai, Sikhar Patranabis, Amin Sakzad, Joseph K. Liu, Debdeep Mukhopadhyay, Ron Steinfeld, Shi-Feng Sun, Dongxi Liu, and Cong Zuo. 2018. Result pattern hiding searchable encryption for conjunctive queries. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201918). ACM, 745\u2013762."},{"issue":"3","key":"e_1_3_2_18_2","first-page":"2005","article-title":"Practical multi-keyword ranked search with access control over encrypted cloud data","volume":"10","author":"Li Jiayi","year":"2020","unstructured":"Jiayi Li, Jianfeng Ma, Yinbin Miao, Ruikang Yang, Ximeng Liu, and Kim-Kwang Raymond Choo. 2020. Practical multi-keyword ranked search with access control over encrypted cloud data. IEEE Transactions on Cloud Computing 10, 3 (2020), 2005\u20132019.","journal-title":"IEEE Transactions on Cloud Computing"},{"issue":"6","key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/TPDS.2011.252","article-title":"A secure erasure code-based cloud storage system with secure data forwarding","volume":"23","author":"Lin Hsiao-Ying","year":"2011","unstructured":"Hsiao-Ying Lin and Wen-Guey Tzeng. 2011. A secure erasure code-based cloud storage system with secure data forwarding. IEEE Transactions on Parallel and Distributed Systems 23, 6 (2011), 995\u20131003.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2932444"},{"issue":"6","key":"e_1_3_2_21_2","first-page":"1322","article-title":"Multi-user verifiable searchable symmetric encryption for cloud storage","volume":"17","author":"Liu Xueqiao","year":"2018","unstructured":"Xueqiao Liu, Guomin Yang, Yi Mu, and Robert H. Deng. 2018. Multi-user verifiable searchable symmetric encryption for cloud storage. IEEE Transactions on Dependable and Secure Computing 17, 6 (2018), 1322\u20131332.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2946476"},{"key":"e_1_3_2_23_2","first-page":"1723","volume-title":"Proc. 31st USENIX Security Symposium (USENIX\u201922)","author":"Mahdavi Rasoul Akhavan","year":"2022","unstructured":"Rasoul Akhavan Mahdavi and Florian Kerschbaum. 2022. Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators. In Proc. 31st USENIX Security Symposium (USENIX\u201922). 1723\u20131740."},{"issue":"4","key":"e_1_3_2_24_2","first-page":"1804","article-title":"Optimized verifiable fine-grained keyword search in dynamic multi-owner settings","volume":"18","author":"Miao Yinbin","year":"2019","unstructured":"Yinbin Miao, Robert H. Deng, Kim-Kwang Raymond Choo, Ximeng Liu, Jianting Ning, and Hongwei Li. 2019. Optimized verifiable fine-grained keyword search in dynamic multi-owner settings. IEEE Transactions on Dependable and Secure Computing 18, 4 (2019), 1804\u20131820.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_2_25_2","first-page":"79","volume-title":"Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919)","author":"Patel Sarvar","year":"2019","unstructured":"Sarvar Patel, Giuseppe Persiano, Kevin Yeo, and Moti Yung. 2019. Mitigating leakage in secure cloud-hosted data structures: Volume-hiding for multi-maps via hashing. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919). 79\u201393."},{"key":"e_1_3_2_26_2","article-title":"Lightweight symmetric-key hidden vector encryption without pairings","author":"Patranabis Sikhar","year":"2017","unstructured":"Sikhar Patranabis and Debdeep Mukhopadhyay. 2017. Lightweight symmetric-key hidden vector encryption without pairings. Cryptology ePrint Archive (2017).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/3321705.3329800","volume-title":"Proc. ACM Asia Conference on Computer and Communications Security (AsiaCCS\u201919)","author":"Schneider Thomas","year":"2019","unstructured":"Thomas Schneider and Oleksandr Tkachenko. 2019. EPISODE: Efficient privacy-preserving similar sequence queries on outsourced genomic databases. In Proc. ACM Asia Conference on Computer and Communications Security (AsiaCCS\u201919). ACM, 315\u2013327."},{"key":"e_1_3_2_28_2","first-page":"44","volume-title":"Proc. IEEE Symposium on Security and Privacy (S&P\u201900)","author":"Song Dawn Xiaoding","year":"2000","unstructured":"Dawn Xiaoding Song, David Wagner, and Adrian Perrig. 2000. Practical techniques for searches on encrypted data. In Proc. IEEE Symposium on Security and Privacy (S&P\u201900). IEEE, 44\u201355."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2973633"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3152168"},{"issue":"6","key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"3606","DOI":"10.1109\/TSC.2021.3083512","article-title":"Vfirm: Verifiable fine-grained encrypted image retrieval in multi-owner multi-user settings","volume":"15","author":"Tong Qiuyun","year":"2021","unstructured":"Qiuyun Tong, Yinbin Miao, Lei Chen, Jian Weng, Ximeng Liu, Kim-Kwang Raymond Choo, and Robert H. Deng. 2021. Vfirm: Verifiable fine-grained encrypted image retrieval in multi-owner multi-user settings. IEEE Transactions on Services Computing 15, 6 (2021), 3606\u20133619.","journal-title":"IEEE Transactions on Services Computing"},{"issue":"4","key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1109\/TCC.2020.3031209","article-title":"VPSL: Verifiable privacy-preserving data search for cloud-assisted Internet of Things","volume":"10","author":"Tong Qiuyun","year":"2020","unstructured":"Qiuyun Tong, Yinbin Miao, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng, and Hongwei Li. 2020. VPSL: Verifiable privacy-preserving data search for cloud-assisted Internet of Things. IEEE Transactions on Cloud Computing 10, 4 (2020), 2964\u20132976.","journal-title":"IEEE Transactions on Cloud Computing"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3152033"},{"key":"e_1_3_2_34_2","first-page":"2825","volume-title":"Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201922)","author":"Wang Jianfeng","year":"2022","unstructured":"Jianfeng Wang, Shi-Feng Sun, Tianci Li, Saiyu Qi, and Xiaofeng Chen. 2022. Practical volume-hiding encrypted multi-maps with optimal overhead and beyond. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS\u201922). 2825\u20132839."},{"key":"e_1_3_2_35_2","first-page":"1","volume-title":"Proc. IEEE International Conference on Communications (ICC\u201921)","author":"Wang Mingyue","year":"2021","unstructured":"Mingyue Wang, Yinbin Miao, Yu Guo, Cong Wang, Hejiao Huang, and Xiaohua Jia. 2021. Attribute-based encrypted search for multi-owner and multi-user model. In Proc. IEEE International Conference on Communications (ICC\u201921). IEEE, 1\u20137."},{"key":"e_1_3_2_36_2","first-page":"2253","volume-title":"Proc. IEEE Conference on Computer Communications (INFOCOM\u201920)","author":"Wang Xiangyu","year":"2020","unstructured":"Xiangyu Wang, Jianfeng Ma, Ximeng Liu, Robert H. Deng, Yinbin Miao, Dan Zhu, and Zhuoran Ma. 2020. Search me in the dark: Privacy-preserving boolean range query over encrypted spatial data. In Proc. IEEE Conference on Computer Communications (INFOCOM\u201920). IEEE, 2253\u20132262."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2006.05.002"},{"key":"e_1_3_2_38_2","article-title":"Privacy-preserving image retrieval based on additive secret sharing","author":"Xia Zhihua","year":"2020","unstructured":"Zhihua Xia, Qi Gu, Lizhi Xiong, Wenhao Zhou, and Jian Weng. 2020. Privacy-preserving image retrieval based on additive secret sharing. arXiv preprint arXiv:2009.06893 (2020).","journal-title":"arXiv preprint arXiv:2009.06893"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3156818"},{"issue":"6","key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"2875","DOI":"10.1109\/TDSC.2020.2968425","article-title":"Multi-client sub-linear boolean keyword searching for encrypted cloud storage with owner-enforced authorization","volume":"18","author":"Zhang Kai","year":"2020","unstructured":"Kai Zhang, Mi Wen, Rongxing Lu, and Kefei Chen. 2020. Multi-client sub-linear boolean keyword searching for encrypted cloud storage with owner-enforced authorization. IEEE Transactions on Dependable and Secure Computing 18, 6 (2020), 2875\u20132887.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3152395"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2016.11.013"},{"key":"e_1_3_2_43_2","first-page":"55","volume-title":"Proc. International workshop on Security in Cloud Computing (AsiaCCS Workshop\u201913)","author":"Zhu Youwen","year":"2013","unstructured":"Youwen Zhu, Rui Xu, and Tsuyoshi Takagi. 2013. Secure k-NN computation on encrypted cloud data without sharing key with query users. In Proc. International workshop on Security in Cloud Computing (AsiaCCS Workshop\u201913). ACM, 55\u201360."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3607255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:35Z","timestamp":1750178255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,3]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,11,30]]}},"alternative-id":["10.1145\/3607255"],"URL":"https:\/\/doi.org\/10.1145\/3607255","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,3]]},"assertion":[{"value":"2022-10-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}