{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T03:02:31Z","timestamp":1779850951943,"version":"3.53.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032078902","type":"print"},{"value":"9783032078919","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07891-9_4","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:23:57Z","timestamp":1760610237000},"page":"63-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Robust Dynamic Searchable Symmetric Encryption Supporting Conjunctive Queries"],"prefix":"10.1007","author":[{"given":"Bingxue","family":"Bian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiaoer","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiatao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684\u2013695. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_61"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Bost, R.: $$\\sum $$o$$\\varphi $$o$$\\varsigma $$: forward secure searchable encryption. In: CCS 2016, pp. 1143\u20131154. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978303","DOI":"10.1145\/2976749.2978303"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: CCS 2017, pp. 1465\u20131482. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: Data structures and implementation. In: NDSS 2014. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Cash","year":"2013","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: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Chamani, J.G., Papadopoulos, D., Papamanthou, C., Jalili, R.: New constructions for forward and backward private symmetric searchable encryption. In: CCS 2018, pp. 1038\u20131055. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243833","DOI":"10.1145\/3243734.3243833"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_33"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS 2006, pp. 79\u201388. ACM (2006). https:\/\/doi.org\/10.1145\/1180405.1180417","DOI":"10.1145\/1180405.1180417"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Demertzis, I., Chamani, J.G., Papadopoulos, D., Papamanthou, C.: Dynamic searchable encryption with small client storage. In: NDSS 2020. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.24423"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Du, K., Wang, J., Wu, J., Wang, Y.: Scalable equi-join queries over encrypted database. In: CCS 2024, pp. 4002\u20134016. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3690377","DOI":"10.1145\/3658644.3690377"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. Proc. Priv. Enhancing Technol. 2018(1), 5\u201320 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0002","DOI":"10.1515\/popets-2018-0002"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw. 8(3), 281\u2013293 (2000). https:\/\/doi.org\/10.1109\/90.851975","DOI":"10.1109\/90.851975"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-56617-7_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Kamara","year":"2017","unstructured":"Kamara, S., Moataz, T.: Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 94\u2013124. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_4"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: CCS 2012, pp. 965\u2013976. ACM (2012). https:\/\/doi.org\/10.1145\/2382196.2382298","DOI":"10.1145\/2382196.2382298"},{"issue":"7","key":"4_CR15","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3390\/electronics8070779","volume":"8","author":"K Kim","year":"2019","unstructured":"Kim, K., Jeong, Y., Lee, Y., Lee, S.: Analysis of counting bloom filters used for count thresholding. Electronics 8(7), 779 (2019)","journal-title":"Electronics"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Patranabis, S., Mukhopadhyay, D.: Forward and backward private conjunctive searchable symmetric encryption. In: NDSS 2021. The Internet Society (2021)","DOI":"10.14722\/ndss.2021.23116"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, 14-17 May 2000. pp. 44\u201355. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Song, X., Dong, C., Yuan, D., Xu, Q., Zhao, M.: Forward private searchable symmetric encryption with optimized I\/O efficiency. IEEE Trans. Dependable Secur. Comput. 17(5), 912\u2013927 (2020). https:\/\/doi.org\/10.1109\/TDSC.2018.2822294","DOI":"10.1109\/TDSC.2018.2822294"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS 2014. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Sun, S., et al.: Practical non-interactive searchable encryption with forward and backward privacy. In: 28th Annual Network and Distributed System Security Symposium, NDSS 2021. The Internet Society (2021)","DOI":"10.14722\/ndss.2021.24162"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Sun, S., et al.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: CCS 2018, pp. 763\u2013780. ACM (2018), https:\/\/doi.org\/10.1145\/3243734.3243782","DOI":"10.1145\/3243734.3243782"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Wang, J., Sun, S., Li, T., Qi, S., Chen, X.: Practical volume-hiding encrypted multi-maps with optimal overhead and beyond. In: CCS 2022, pp. 2825\u20132839. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3559345","DOI":"10.1145\/3548606.3559345"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Xu, P., Susilo, W., Wang, W., Chen, T., Wu, Q., Liang, K., Jin, H.: ROSE: robust searchable encryption with forward and backward security. IEEE Trans. Inf. Forensics Secur. 17, 1115\u20131130 (2022), https:\/\/doi.org\/10.1109\/TIFS.2022.3155977","DOI":"10.1109\/TIFS.2022.3155977"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Yuan, D., Cui, S., Russello, G.: We can make mistakes: fault-tolerant forward private verifiable dynamic searchable symmetric encryption. In: EuroS &P 2022, pp. 587\u2013605. IEEE (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00043","DOI":"10.1109\/EuroSP53844.2022.00043"},{"key":"4_CR25","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, pp. 707\u2013720. USENIX Association (2016)"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Zheng, Y., Xu, P., Wang, M., Xu, W., Wang, W., Chen, T., Jin, H.: Themis: robust and light-client dynamic searchable symmetric encryption. IEEE Trans. Inf. Forensics Secur. 19, 8802\u20138816 (2024). https:\/\/doi.org\/10.1109\/TIFS.2024.3463971","DOI":"10.1109\/TIFS.2024.3463971"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Zuo, C., et al.: Searchable encryption for conjunctive queries with extended forward and backward privacy. Proc. Priv. Enhancing Technol. 2025(1), 440\u2013455 (2025). https:\/\/doi.org\/10.56553\/popets-2025-0024","DOI":"10.56553\/popets-2025-0024"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-030-29962-0_14","volume-title":"Computer Security \u2013 ESORICS 2019","author":"C Zuo","year":"2019","unstructured":"Zuo, C., Sun, S.-F., Liu, J.K., Shao, J., Pieprzyk, J.: Dynamic searchable symmetric encryption with forward and stronger backward privacy. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 283\u2013303. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_14"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07891-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T02:19:56Z","timestamp":1779848396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07891-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9783032078902","9783032078919"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07891-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"17 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.esorics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}