{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T20:06:54Z","timestamp":1779566814811,"version":"3.53.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267399","type":"print"},{"value":"9783032267405","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-26740-5_10","type":"book-chapter","created":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T19:29:51Z","timestamp":1779564591000},"page":"302-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and\u00a0Post-quantum Conjunctive Dynamic SSE with\u00a0Strong Privacy Guarantees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8279-7330","authenticated-orcid":false,"given":"Bibhas Chandra","family":"Das","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9761-1192","authenticated-orcid":false,"given":"Nilanjan","family":"Datta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2672-7331","authenticated-orcid":false,"given":"Avijit","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3343-1085","authenticated-orcid":false,"given":"Avishek","family":"Majumder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6499-8346","authenticated-orcid":false,"given":"Debdeep","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-7939","authenticated-orcid":false,"given":"Sikhar","family":"Patranabis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5737-2281","authenticated-orcid":false,"given":"Subhabrata","family":"Samajder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7433-0497","authenticated-orcid":false,"given":"Laltu","family":"Sardar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Module-lattice-based key-encapsulation mechanism standard. https:\/\/doi.org\/10.6028\/NIST.FIPS.203","DOI":"10.6028\/NIST.FIPS.203"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: Crystals-kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European symposium on security and privacy (EuroS&P), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bost, R.: $$\\sum $$o$$\\varphi $$o$$\\varsigma $$: Forward secure searchable encryption. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 1143\u20131154. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978303","DOI":"10.1145\/2976749.2978303"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Thuraisingham, B., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 1465\u20131482. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"10_CR8","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Electron. Colloquium Comput. Complex. TR11-111 (2011). https:\/\/eccc.weizmann.ac.il\/report\/2011\/111"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Ray, I., Li, N., Kruegel, C. (eds.) Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015, pp. 668\u2013679. ACM (2015). https:\/\/doi.org\/10.1145\/2810103.2813700","DOI":"10.1145\/2810103.2813700"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, 23\u201326 February 2014. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"10_CR11","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, Part I. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds) EUROCRYPT 2023. LNCS, vol. 14008, pp. 423\u2013447. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part III. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"10_CR14","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: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 1038\u20131055. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243833","DOI":"10.1145\/3243734.3243833"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11496137_30","volume-title":"Applied Cryptography and Network Security","author":"Y-C Chang","year":"2005","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442\u2013455. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_30"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3233\/JCS-191322","volume":"28","author":"S Chatterjee","year":"2020","unstructured":"Chatterjee, S., Puria, S.K.P., Shah, A.: Efficient backward private searchable encryption. J. Comput. Secur. 28(2), 229\u2013267 (2020). https:\/\/doi.org\/10.3233\/JCS-191322","journal-title":"J. Comput. Secur."},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Juels, A., Wright, R.N., di\u00a0Vimercati, S.D.C. (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, 30 October\u20133 November 2006, pp. 79\u201388. ACM (2006). https:\/\/doi.org\/10.1145\/1180405.1180417","DOI":"10.1145\/1180405.1180417"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Dartois, P., et al.: PEGASIS: practical effective class group action using 4-dimensional isogenies. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16000, pp. 67\u201399. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_3","DOI":"10.1007\/978-3-032-01855-7_3"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Das, B.C.: Conjunctive dynamic SSE schemes under scrutiny: Exposing privacy issues in SDSSE-CQ-S and VCDSSE. In: Nitaj, A., Petkova-Nikova, S., Rijmen, V. (eds.) AFRICACRYPT 2025. LNCS, vol. 15651, pp. 417\u2013440. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-97260-7_19","DOI":"10.1007\/978-3-031-97260-7_19"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"De Feo, L., et al.: SCALLOP: scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 345\u2013375. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosu, M., Steiner, M.: Rich queries on encrypted data: beyond exact matches. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 123\u2013145. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24177-7_7","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"10_CR22","unstructured":"Goh, E.: Secure indexes. IACR Cryptol. ePrint Arch. p.\u00a0216 (2003). http:\/\/eprint.iacr.org\/2003\/216"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996). https:\/\/doi.org\/10.1145\/233551.233553","journal-title":"J. ACM"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"35035","DOI":"10.1109\/ACCESS.2019.2902855","volume":"7","author":"C Hu","year":"2019","unstructured":"Hu, C., Song, X., Liu, P., Xin, Y., Xu, Y., Duan, Y., Hao, R.: Forward secure conjunctive-keyword searchable encryption. IEEE Access 7, 35035\u201335048 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2902855","journal-title":"IEEE Access"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: 21st ACM STOC, pp. 12\u201324. ACM Press (1989). https:\/\/doi.org\/10.1145\/73007.73009","DOI":"10.1145\/73007.73009"},{"key":"10_CR26","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, Part III. LNCS, vol. 10212, pp. 94\u2013124. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_4"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) the ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC, USA, 16\u201318 October 2012, pp. 965\u2013976. ACM (2012). https:\/\/doi.org\/10.1145\/2382196.2382298","DOI":"10.1145\/2382196.2382298"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Lai, S., Patranabis, S., Sakzad, A., Liu, J.K., Mukhopadhyay, D., Steinfeld, R., Sun, S., Liu, D., Zuo, C.: Result pattern hiding searchable encryption for conjunctive queries. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 745\u2013762. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243753","DOI":"10.1145\/3243734.3243753"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Patranabis, S., Mukhopadhyay, D.: Forward and backward private conjunctive searchable symmetric encryption. In: 28th Annual Network and Distributed System Security Symposium, NDSS 2021, virtually, 21\u201325 February 2021. The Internet Society (2021). https:\/\/www.ndss-symposium.org\/ndss-paper\/forward-and-backward-private-conjunctive-searchable-symmetric-encryption\/","DOI":"10.14722\/ndss.2021.23116"},{"issue":"6","key":"10_CR34","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. J. ACM 51(6), 899\u2013942 (2004)","journal-title":"J. ACM"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, pp. 191\u2013204. IEEE Computer Society (2010)","DOI":"10.1109\/CCC.2010.26"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 472\u2013503. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"10_CR38","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\u201317 May 2000, pp. 44\u201355. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Sadeghi, A., Gligor, V.D., Yung, M. (eds.) 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 299\u2013310. ACM (2013). https:\/\/doi.org\/10.1145\/2508859.2516660","DOI":"10.1145\/2508859.2516660"},{"key":"10_CR40","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, virtually, 21\u201325 February 2021. The Internet Society (2021)","DOI":"10.14722\/ndss.2021.24162"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Sun, S., et al.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 763\u2013780. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243782","DOI":"10.1145\/3243734.3243782"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Talapatra, D., Patranabis, S., Mukhopadhyay, D.: Conjunctive searchable symmetric encryption from hard lattices. In: 8th IEEE European Symposium on Security and Privacy, EuroS&P 2023, Delft, Netherlands, 3\u20137 July 2023, pp. 958\u2013978. IEEE (2023). https:\/\/doi.org\/10.1109\/EUROSP57164.2023.00061","DOI":"10.1109\/EUROSP57164.2023.00061"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Talapatra, D., Patranabis, S., Mukhopadhyay, D.: Highly scalable searchable symmetric encryption for Boolean queries from NTRU lattice trapdoors. IACR Commun. Cryptol. 2(2), 6 (2025). https:\/\/doi.org\/10.62056\/AE89N59P1","DOI":"10.62056\/AE89N59P1"},{"key":"10_CR44","doi-asserted-by":"publisher","first-page":"142762","DOI":"10.1109\/ACCESS.2019.2944246","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Wang, J., Sun, S., Miao, M., Chen, X.: Toward forward secure SSE supporting conjunctive keyword search. IEEE Access 7, 142762\u2013142772 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2944246","journal-title":"IEEE Access"},{"issue":"1","key":"10_CR45","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00778-018-0517-6","volume":"28","author":"Z Wu","year":"2019","unstructured":"Wu, Z., Li, K.: VBTree: forward secure conjunctive queries over encrypted data for cloud computing. VLDB J. 28(1), 25\u201346 (2019). https:\/\/doi.org\/10.1007\/s00778-018-0517-6","journal-title":"VLDB J."},{"key":"10_CR46","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.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, 10\u201312 August 2016, pp. 707\u2013720. USENIX Association (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/zhang"},{"key":"10_CR47","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":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-98989-1_12","volume-title":"Computer Security","author":"C Zuo","year":"2018","unstructured":"Zuo, C., Sun, S.-F., Liu, J.K., Shao, J., Pieprzyk, J.: Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018, Part II. LNCS, vol. 11099, pp. 228\u2013246. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_12"},{"key":"10_CR49","unstructured":"Zuo, C., Sun, S., Liu, J.K., Shao, J., Pieprzyk, J., Wei, G.: Forward and backward private dynamic searchable symmetric encryption for conjunctive queries. IACR Cryptol. ePrint Arch. 1357 (2020). https:\/\/eprint.iacr.org\/2020\/1357"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26740-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T19:29:54Z","timestamp":1779564594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26740-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267399","9783032267405"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26740-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}