{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:09:27Z","timestamp":1764842967955,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609536"},{"type":"electronic","value":"9789819609543"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0954-3_6","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:39Z","timestamp":1738345839000},"page":"106-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compressed Cookies: Practical Wildcard Symmetric Searchable Encryption with\u00a0Optimized Storage"],"prefix":"10.1007","author":[{"given":"Jiaojiao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-981-99-8736-8_8","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"G Amjad","year":"2023","unstructured":"Amjad, G., Kamara, S., Moataz, T.: Injection-secure structured and searchable symmetric encryption. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14443, pp. 232\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_8"},{"issue":"7","key":"6_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-23556-6_8","volume-title":"Secure Data Management","author":"C B\u00f6sch","year":"2011","unstructured":"B\u00f6sch, C., Brinkman, R., Hartel, P., Jonker, W.: Conjunctive wildcard search over encrypted data. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2011. LNCS, vol. 6933, pp. 114\u2013127. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23556-6_8"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bost, R.: $$\\sum $$o$$\\varphi $$o$$\\varsigma $$: forward secure searchable encryption. In: CCS, pp. 1143\u20131154. ACM (2016)","DOI":"10.1145\/2976749.2978303"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: CCS, pp. 1465\u20131482. ACM (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"6_CR6","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":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chen, T., et al.: The power of bamboo: On the post-compromise security for searchable symmetric encryption. In: NDSS. The Internet Society (2023)","DOI":"10.14722\/ndss.2023.24725"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS, pp. 79\u201388. ACM (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than bloom. In: CoNEXT, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Graf, T.M., Lemire, D.: XOR filters: faster and smaller than bloom and cuckoo filters. ACM J. Exp. Algorithmics 25, 1.5:1\u20131.5:16 (2020)","DOI":"10.1145\/3376122"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10207-015-0302-0","volume":"15","author":"C Hu","year":"2016","unstructured":"Hu, C., Han, L.: Efficient wildcard search over encrypted data. Int. J. Inf. Sec. 15(5), 539\u2013547 (2016)","journal-title":"Int. J. Inf. Sec."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-03326-2_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"S Kamara","year":"2018","unstructured":"Kamara, S., Moataz, T.: SQL on structurally-encrypted databases. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 149\u2013180. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_6"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: CCS, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"issue":"3","key":"6_CR14","first-page":"2178","volume":"16","author":"Y Li","year":"2023","unstructured":"Li, Y., Ning, J., Chen, J.: Secure and practical wildcard searchable encryption system based on inner product. IEEE Trans. Serv. Comput. 16(3), 2178\u20132190 (2023)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-15317-4_10","volume-title":"Security and Cryptography for Networks","author":"S Sedghi","year":"2010","unstructured":"Sedghi, S., van Liesdonk, P., Nikova, S., Hartel, P., Jonker, W.: Searching keywords with wildcards on encrypted data. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 138\u2013153. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_10"},{"key":"6_CR16","unstructured":"Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: S &P, pp. 44\u201355. IEEE Computer Society (2000)"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/TDSC.2018.2822294","volume":"17","author":"X Song","year":"2020","unstructured":"Song, X., Dong, C., Yuan, D., Xu, Q., Zhao, M.: Forward private searchable symmetric encryption with optimized I\/O efficiency. IEEE Trans. Dependable Secure Comput. 17(5), 912\u2013927 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-33272-2_15","volume-title":"Provable Security","author":"T Suga","year":"2012","unstructured":"Suga, T., Nishide, T., Sakurai, K.: Secure keyword search using bloom filter with specified character positions. In: Takagi, T., Wang, G., Qin, Z., Jiang, S., Yu, Y. (eds.) ProvSec 2012. LNCS, vol. 7496, pp. 235\u2013252. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33272-2_15"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Wang, J., Sun, S., Li, T., Qi, S., Chen, X.: Practical volume-hiding encrypted multi-maps with optimal overhead and beyond. In: CCS, pp. 2825\u20132839. ACM (2022)","DOI":"10.1145\/3548606.3559345"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Wang, Q., Hu, D., Li, M., Yang, G.: Secure and flexible wildcard queries. IEEE Trans. Inf. Forensics Secur. 1 (2024). https:\/\/doi.org\/10.1109\/TIFS.2024.3430056","DOI":"10.1109\/TIFS.2024.3430056"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-031-10684-2_13","volume-title":"Data and Applications Security and Privacy XXXVI","author":"J Weener","year":"2022","unstructured":"Weener, J., Hahn, F., Peter, A.: Libertas: Backward private dynamic searchable symmetric encryption supporting wildcards. In: Sural, S., Lu, H. (eds.) DBSec 2022. LNCS, vol. 13383, pp. 215\u2013235. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10684-2_13"},{"issue":"12","key":"6_CR23","doi-asserted-by":"publisher","first-page":"7475","DOI":"10.1002\/int.22595","volume":"36","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Zhao, B., Qin, J., Hou, W., Su, Y., Yang, H.: Practical wildcard searchable encryption with tree-based index. Int. J. Intell. Syst. 36(12), 7475\u20137499 (2021)","journal-title":"Int. J. Intell. Syst."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-46298-1_18","volume-title":"Network and System Security","author":"F Zhao","year":"2016","unstructured":"Zhao, F., Nishide, T.: Searchable symmetric encryption supporting queries with multiple-character wildcards. In: Chen, J., Piuri, V., Su, C., Yung, M. (eds.) NSS 2016. LNCS, vol. 9955, pp. 266\u2013282. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46298-1_18"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0954-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:45Z","timestamp":1738345845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0954-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609536","9789819609543"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0954-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2024.github.io\/ProvSec2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}