{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T11:35:14Z","timestamp":1781523314745,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987351","type":"print"},{"value":"9789819987368","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8736-8_9","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T06:01:54Z","timestamp":1702792914000},"page":"263-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hermes: I\/O-Efficient Forward-Secure Searchable Symmetric Encryption"],"prefix":"10.1007","author":[{"given":"Brice","family":"Minaud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Asharov, G., Naor, M., Segev, G., Shahaf, I.: Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 1101\u20131114. ACM Press, June 2016. https:\/\/doi.org\/10.1145\/2897518.2897562","DOI":"10.1145\/2897518.2897562"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00145-020-09370-z","volume":"34","author":"G Asharov","year":"2021","unstructured":"Asharov, G., Segev, G., Shahaf, I.: Tight tradeoffs in searchable symmetric encryption. J. Cryptol. 34(2), 9 (2021). https:\/\/doi.org\/10.1007\/s00145-020-09370-z","journal-title":"J. Cryptol."},{"key":"9_CR3","unstructured":"Axboe, J.: Flexible I\/O Tester (2020). https:\/\/github.com\/axboe\/fio"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, pp. 593\u2013602 (1994)","DOI":"10.1145\/195058.195412"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-84252-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Bossuat","year":"2021","unstructured":"Bossuat, A., Bost, R., Fouque, P.-A., Minaud, B., Reichle, M.: SSE and SSD: page-efficient searchable symmetric encryption. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 157\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_6"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bost, R.: $$\\Sigma o \\phi 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 Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978303","DOI":"10.1145\/2976749.2978303"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.2478\/popets-2019-0062","volume":"2019","author":"R Bost","year":"2019","unstructured":"Bost, R., Fouque, P.A.: Security-efficiency tradeoffs in searchable encryption. PoPETs 2019(4), 132\u2013151 (2019). https:\/\/doi.org\/10.2478\/popets-2019-0062","journal-title":"PoPETs"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1465\u20131482. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS 2014. The Internet Society, February 2014","DOI":"10.14722\/ndss.2014.23264"},{"key":"9_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, Part I. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-55220-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Cash","year":"2014","unstructured":"Cash, D., Tessaro, S.: The locality of searchable symmetric encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 351\u2013368. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_20"},{"key":"9_CR12","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., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 79\u201388. ACM Press, October\/November 2006. https:\/\/doi.org\/10.1145\/1180405.1180417","DOI":"10.1145\/1180405.1180417"},{"key":"9_CR13","unstructured":"Demertzis, I., Chamani, J.G., Papadopoulos, D., Papamanthou, C.: Dynamic searchable encryption with small client storage. In: ISOC Network and Distributed System Security - NDSS 2022 (2022)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-96884-1_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Demertzis","year":"2018","unstructured":"Demertzis, I., Papadopoulos, D., Papamanthou, C.: Searchable encryption with optimal locality: achieving sublogarithmic read efficiency. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 371\u2013406. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_13"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Demertzis, I., Papamanthou, C.: Fast searchable encryption with tunable locality. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 1053\u20131067 (2017)","DOI":"10.1145\/3035918.3064057"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. In: Proceedings on Privacy Enhancing Technologie - PoPETS 2018 (2018)","DOI":"10.1515\/popets-2018-0002"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Grubbs, P., Lacharit\u00e9, M.S., Minaud, B., Paterson, K.G.: Learning to reconstruct: statistical learning theory and encrypted database attacks. In: 2019 IEEE Symposium on Security and Privacy, pp. 1067\u20131083. IEEE Computer Society Press, May 2019. https:\/\/doi.org\/10.1109\/SP.2019.00030","DOI":"10.1109\/SP.2019.00030"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kamara, S., Moataz, T., Park, A., Qin, L.: A decentralized and encrypted national gun registry. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 1520\u20131537. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00072"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-96881-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"KG Larsen","year":"2018","unstructured":"Larsen, K.G., Nielsen, J.B.: Yes, there is an oblivious RAM lower bound! In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Miers, I., Mohassel, P.: IO-DSSE: scaling dynamic searchable encryption to millions of indexes by improving locality. In: NDSS 2017. The Internet Society, February\/March 2017","DOI":"10.14722\/ndss.2017.23394"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-031-15985-5_4","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"B Minaud","year":"2022","unstructured":"Minaud, B., Reichle, M.: Dynamic local searchable symmetric encryption. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 91\u2013120. Springer, Lecture Notes in Computer Science (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_4"},{"key":"9_CR22","unstructured":"MongoDB: Queryable encryption (2022). https:\/\/www.mongodb.com\/products\/queryable-encryption"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 644\u2013655. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813651","DOI":"10.1145\/2810103.2813651"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Patranabis, S., Mukhopadhyay, D.: Forward and backward private conjunctive searchable symmetric encryption. In: ISOC Network and Distributed System Security - NDSS 2021 (2021)","DOI":"10.14722\/ndss.2021.23116"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44\u201355. IEEE Computer Society Press, May 2000. https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS 2014. The Internet Society, February 2014","DOI":"10.14722\/ndss.2014.23298"},{"key":"9_CR27","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, August 2016"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8736-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:31Z","timestamp":1765933351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8736-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987351","9789819987368"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8736-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","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":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"106","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":"0","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":"28% - 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","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}