{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:34:11Z","timestamp":1784874851855,"version":"3.55.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031171390","type":"print"},{"value":"9783031171406","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17140-6_32","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:19:49Z","timestamp":1664000389000},"page":"653-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["VAL: Volume and\u00a0Access Pattern Leakage-Abuse Attack with\u00a0Leaked Documents"],"prefix":"10.1007","author":[{"given":"Steven","family":"Lambregts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huanhuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianting","family":"Ning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaitai","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla, M., et al.: Searchable encryption revisited:\u00a0consistency properties, relation to anonymous IBE, and extensions. In: Shoup, V., et al. (eds.) CRYPTO 2005. LNCS, vol. 3621, pp. 205\u2013222. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_13"},{"key":"32_CR2","unstructured":"Apache: Mail archieves of lucene (1999). https:\/\/mail-archives.apache.org\/mod_mbox\/#lucene"},{"key":"32_CR3","unstructured":"Bird, S., Klein, E., Loper, E.: Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit. O\u2019Reilly Media, Inc, Beijing (2009)"},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Blackstone, L., Kamara, S., Moataz, T.: Revisiting leakage abuse attacks. In: NDSS 2020. The Internet Society (2020). https:\/\/doi.org\/10.14722\/ndss.2020.23103","DOI":"10.14722\/ndss.2020.23103"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"32_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.) ACM CCS 2016, pp. 1143\u20131154. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978303","DOI":"10.1145\/2976749.2978303"},{"key":"32_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.) ACM CCS 2017, pp. 1465\u20131482. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"32_CR8","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.) ACM CCS 2015, pp. 668\u2013679. ACM (2015). https:\/\/doi.org\/10.1145\/2810103.2813700","DOI":"10.1145\/2810103.2813700"},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS 2014. The Internet Society (2014). https:\/\/doi.org\/10.14722\/ndss.2014.23264","DOI":"10.14722\/ndss.2014.23264"},{"key":"32_CR10","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":"32_CR11","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":"32_CR12","doi-asserted-by":"publisher","unstructured":"Chen, G., Lai, T., Reiter, M.K., Zhang, Y.: Differentially private access patterns for searchable symmetric encryption. In: IEEE INFOCOM 2018, pp. 810\u2013818. IEEE (2018). https:\/\/doi.org\/10.1109\/INFOCOM.2018.8486381","DOI":"10.1109\/INFOCOM.2018.8486381"},{"key":"32_CR13","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 Vimercati, S.D.C. (eds.) ACM CCS 2006, pp. 79\u201388. ACM (2006). https:\/\/doi.org\/10.1145\/1180405.1180417","DOI":"10.1145\/1180405.1180417"},{"key":"32_CR14","unstructured":"Damie, M., Hahn, F., Peter, A.: A highly accurate query-recovery attack against searchable encryption using non-indexed documents. In: Bailey, M., Greenstadt, R. (eds.) USENIX 2021, pp. 143\u2013160. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/damie"},{"key":"32_CR15","doi-asserted-by":"publisher","unstructured":"Demertzis, I., Papamanthou, C.: Fast searchable encryption with tunable locality. In: Salihoglu, S., Zhou, W., Chirkova, R., Yang, J., Suciu, D. (eds.) ACM SIGMOD 2017, pp. 1053\u20131067. ACM (2017). https:\/\/doi.org\/10.1145\/3035918.3064057","DOI":"10.1145\/3035918.3064057"},{"key":"32_CR16","unstructured":"Gui, Z., Paterson, K.G., Patranabis, S.: Rethinking searchable symmetric encryption. Cryptology ePrint Archive, Paper 2021\/879 (2021). https:\/\/eprint.iacr.org\/2021\/879"},{"key":"32_CR17","doi-asserted-by":"publisher","unstructured":"He, W., Akhawe, D., Jain, S., Shi, E., Song, D.X.: Shadowcrypt: encrypted web applications for everyone. In: Ahn, G., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 1028\u20131039. ACM (2014). https:\/\/doi.org\/10.1145\/2660267.2660326","DOI":"10.1145\/2660267.2660326"},{"key":"32_CR18","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS 2012. The Internet Society (2012). https:\/\/www.ndss-symposium.org\/ndss2012\/access-pattern-disclosure-searchable-encryption-ramification-attack-and-mitigation"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-17656-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Kamara","year":"2019","unstructured":"Kamara, S., Moataz, T.: Computationally volume-hiding structured encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 183\u2013213. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_7"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2013","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258\u2013274. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_22"},{"key":"32_CR21","doi-asserted-by":"publisher","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 965\u2013976. ACM (2012). https:\/\/doi.org\/10.1145\/2382196.2382298","DOI":"10.1145\/2382196.2382298"},{"key":"32_CR22","unstructured":"Kortekaas, Y.: Access pattern hiding aggregation over encrypted databases, October 2020. https:\/\/essay.utwente.nl\/83874\/"},{"key":"32_CR23","unstructured":"Lau, B., Chung, S.P., Song, C., Jang, Y., Lee, W., Boldyreva, A.: Mimesis aegis: a mimicry privacy shield-a system\u2019s approach to data privacy on public cloud. In: Fu, K., Jung, J. (eds.) USENIX 2014, pp. 33\u201348. USENIX Association (2014). https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/lau"},{"key":"32_CR24","doi-asserted-by":"publisher","unstructured":"Li, J., Niu, X., Sun, J.S.: A practical searchable symmetric encryption scheme for smart grid data. In: IEEE ICC 2019, pp. 1\u20136. IEEE (2019). https:\/\/doi.org\/10.1109\/ICC.2019.8761599","DOI":"10.1109\/ICC.2019.8761599"},{"key":"32_CR25","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.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176\u2013188 (2014). https:\/\/doi.org\/10.1016\/j.ins.2013.11.021","journal-title":"Inf. Sci."},{"key":"32_CR26","doi-asserted-by":"publisher","unstructured":"Ma, Q., Zhang, J., Peng, Y., Zhang, W., Qiao, D.: SE-ORAM: a storage-efficient oblivious RAM for privacy-preserving access to cloud storage. In: Qiu, M., Tao, L., Niu, J. (eds.) IEEE CSCloud 2016, pp. 20\u201325. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/CSCloud.2016.24","DOI":"10.1109\/CSCloud.2016.24"},{"key":"32_CR27","unstructured":"Minaud, B., Reichle, M.: Dynamic local searchable symmetric encryption. arXiv preprint (2022). https:\/\/arxiv.org\/abs\/2201.05006"},{"key":"32_CR28","doi-asserted-by":"publisher","unstructured":"Ning, J., et al.: LEAP: leakage-abuse attack on efficiently deployable, efficiently searchable encryption with partially known dataset. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2307\u20132320. ACM (2021). https:\/\/doi.org\/10.1145\/3460120.3484540","DOI":"10.1145\/3460120.3484540"},{"key":"32_CR29","doi-asserted-by":"publisher","unstructured":"Patel, S., Persiano, G., Yeo, K., Yung, M.: Mitigating leakage in secure cloud-hosted data structures: volume-hiding for multi-maps via hashing. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM SIGSAC 2019, pp. 79\u201393. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3354213","DOI":"10.1145\/3319535.3354213"},{"key":"32_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1108\/00330330610681286","volume":"40","author":"MF Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program 40, 211\u2013218 (1980)","journal-title":"Program"},{"key":"32_CR31","doi-asserted-by":"publisher","unstructured":"Pouliot, D., Wright, C.V.: The shadow nemesis: inference attacks on efficiently deployable, efficiently searchable encryption. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM SIGSAC 2016, pp. 1341\u20131352. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978401","DOI":"10.1145\/2976749.2978401"},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Shang, Z., Oya, S., Peter, A., Kerschbaum, F.: Obfuscated access and search patterns in searchable encryption. In: NDSS 2021. The Internet Society (2021). https:\/\/www.ndss-symposium.org\/ndss-paper\/obfuscated-access-and-search-patterns-in-searchable-encryption\/","DOI":"10.14722\/ndss.2021.23041"},{"key":"32_CR33","unstructured":"Shapiro, D.: Convert Wikipedia database dumps into plaintext files (2021). https:\/\/github.com\/daveshap\/PlainTextWikipedia"},{"key":"32_CR34","doi-asserted-by":"publisher","unstructured":"Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S &P 2000, pp. 44\u201355. IEEE (2000). https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"32_CR35","unstructured":"William W. Cohen, MLD, C.: Enron email datasets (2015). https:\/\/www.cs.cmu.edu\/~enron\/"},{"issue":"5","key":"32_CR36","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1587\/transinf.E92.D.888","volume":"92\u2013D","author":"R Zhang","year":"2009","unstructured":"Zhang, R., Imai, H.: Combining public key encryption with keyword search and public key encryption. IEICE Trans. Inf. Syst. 92\u2013D(5), 888\u2013896 (2009). https:\/\/doi.org\/10.1587\/transinf.E92.D.888","journal-title":"IEICE Trans. Inf. Syst."},{"key":"32_CR37","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 2016, pp. 707\u2013720. USENIX Association (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/zhang"},{"key":"32_CR38","doi-asserted-by":"publisher","unstructured":"Zheng, Q., Xu, S., Ateniese, G.: VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: IEEE INFOCOM 2014, pp. 522\u2013530. IEEE (2014). https:\/\/doi.org\/10.1109\/INFOCOM.2014.6847976","DOI":"10.1109\/INFOCOM.2014.6847976"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17140-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:26:01Z","timestamp":1664000761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17140-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171390","9783031171406"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17140-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","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":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.compute.dtu.dk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"562","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}