{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:32:45Z","timestamp":1783791165122,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s11704-022-2236-9","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T08:49:02Z","timestamp":1672994942000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["IXT: Improved searchable encryption for multi-word queries based on PSI"],"prefix":"10.1007","volume":"17","author":[{"given":"Yunbo","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiachen","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shangmin","family":"Dou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,6]]},"reference":[{"key":"2236_CR1","doi-asserted-by":"crossref","unstructured":"Cash D, Jarecki S, Jutla C, Krawczyk H, Ro\u015fu M C, Steiner M. Highly-scalable searchable symmetric encryption with support for Boolean queries. In: Proceedings of the 33rd Annual Cryptology Conference. 2013, 353\u2013373","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"2236_CR2","doi-asserted-by":"crossref","unstructured":"Lai S, Patranabis S, Sakzad A, Liu J K, Mukhopadhyay D, Steinfeld R, Sun S F, Liu D, Zuo C. Result pattern hiding searchable encryption for conjunctive queries. In: Proceedings of 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018, 745\u2013762","DOI":"10.1145\/3243734.3243753"},{"issue":"5","key":"2236_CR3","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola R, Garay J, Kamara S, Ostrovsky R. Searchable symmetric encryption: improved definitions and efficient constructions. Journal of Computer Security, 2011, 19(5): 895\u2013934","journal-title":"Journal of Computer Security"},{"key":"2236_CR4","doi-asserted-by":"crossref","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Proceedings of 2004 International Conference on the Theory and Applications of Cryptographic Techniques on Cryptology. 2004, 1\u201319","DOI":"10.1007\/978-3-540-24676-3_1"},{"issue":"1","key":"2236_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-021-00961-w","volume":"90","author":"K Lee","year":"2022","unstructured":"Lee K, Seo M. Functional encryption for set intersection in the multi-client setting. Designs, Codes and Cryptography, 2022, 90(1): 17\u201347","journal-title":"Designs, Codes and Cryptography"},{"key":"2236_CR6","unstructured":"Huang Y, Evans D, Katz J. Private set intersection: are garbled circuits better than custom protocols? In: Proceedings of the 19th Network and Distributed Security Symposium. 2012"},{"key":"2236_CR7","doi-asserted-by":"crossref","unstructured":"Dong C, Chen L, Wen Z. When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of 2013 ACM SIGSAC Conference on Computer & Communications Security. 2013, 789\u2013800","DOI":"10.1145\/2508859.2516701"},{"key":"2236_CR8","doi-asserted-by":"crossref","unstructured":"Chen H, Laine K, Rindal P. Fast private set intersection from homomorphic encryption. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1243\u20131255","DOI":"10.1145\/3133956.3134061"},{"key":"2236_CR9","doi-asserted-by":"crossref","unstructured":"Chen H, Huang Z, Laine K, Rindal P. Labeled PSI from fully homomorphic encryption with malicious security. In: Proceedings of 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018, 1223\u20131237","DOI":"10.1145\/3243734.3243836"},{"key":"2236_CR10","doi-asserted-by":"crossref","unstructured":"Wang J, Chen X, Sun S F, Liu J K, Au M H, Zhan Z H. Towards efficient verifiable conjunctive keyword search for large encrypted database. In: Proceedings of the 23rd European Symposium on Research in Computer Security. 2018, 83\u2013100","DOI":"10.1007\/978-3-319-98989-1_5"},{"key":"2236_CR11","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","volume":"265","author":"C Liu","year":"2014","unstructured":"Liu C, Zhu L, Wang M, Tan Y A. Search pattern leakage in searchable encryption: attacks and new construction. Information Sciences, 2014, 265: 176\u2013188","journal-title":"Information Sciences"},{"issue":"12","key":"2236_CR12","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1109\/TIFS.2013.2288131","volume":"8","author":"A Peter","year":"2013","unstructured":"Peter A, Tews E, Katzenbeisser S. Efficiently outsourcing multiparty computation under multiple keys. IEEE Transactions on Information Forensics and Security, 2013, 8(12): 2046\u20132058","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2236_CR13","unstructured":"Islam M S, Kuzu M, Kantarcioglu M. Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: Proceedings of the 19th Annual Network and Distributed System Security Symposium. 2012, 12"},{"key":"2236_CR14","doi-asserted-by":"crossref","unstructured":"Garg S, Mohassel P, Papamanthou C. TWORAM: efficient oblivious ram in two rounds with applications to searchable encryption. In: Proceedings of the 36th Annual International Cryptology Conference. 2016, 563\u2013592","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"2236_CR15","doi-asserted-by":"crossref","unstructured":"Wang B, Song W, Lou W, Hou Y T. Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee. In: Proceedings of 2015 IEEE Conference on Computer Communications (INFOCOM). 2015, 2092\u20132100","DOI":"10.1109\/INFOCOM.2015.7218594"},{"issue":"2","key":"2236_CR16","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1109\/TSC.2020.2973139","volume":"15","author":"Y Wang","year":"2022","unstructured":"Wang Y, Sun S F, Wang J, Liu J K, Chen X. Achieving searchable encryption scheme with search pattern hidden. IEEE Transactions on Services Computing, 2022, 15(2): 1012\u20131025","journal-title":"IEEE Transactions on Services Computing"},{"key":"2236_CR17","doi-asserted-by":"crossref","unstructured":"Pinkas B, Rosulek M, Trieu N, Yanai A. PSI from PaXoS: fast, malicious private set intersection. In: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2020, 739\u2013767","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"2236_CR18","unstructured":"Rabin M O. How to exchange secrets with oblivious transfer. Paper 2005\/187. Cryptology ePrint Archive, 2005"},{"key":"2236_CR19","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Kumaresan R. Improved OT extension for transferring short secrets. In: Proceedings of the 33rd Annual Cryptology Conference. 2013, 54\u201370","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"2236_CR20","doi-asserted-by":"crossref","unstructured":"Orr\u00f9 M, Orsini E, Scholl P. Actively secure 1-out-of-N OT extension with application to private set intersection. In: Proceedings of 2017 Cryptographers\u2019 Track at the RSA Conference on Topics in Cryptology. 2017, 381\u2013396","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"2236_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Vol. 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O. Foundations of Cryptography: Vol. 2, Basic Applications. Cambridge: Cambridge University Press, 2004"},{"key":"2236_CR22","unstructured":"Apache Lucene. See Lucene.apache website"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2236-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-2236-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2236-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T21:30:21Z","timestamp":1731965421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-2236-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,6]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2236"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-2236-9","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,6]]},"assertion":[{"value":"20 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"175811"}}