{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:47:50Z","timestamp":1783788470177,"version":"3.55.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159848","type":"print"},{"value":"9783031159855","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-15985-5_4","type":"book-chapter","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:02:37Z","timestamp":1665432157000},"page":"91-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Dynamic Local 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":[[2022,10,11]]},"reference":[{"key":"4_CR1","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":"4_CR2","doi-asserted-by":"crossref","unstructured":"Amjad, G., Kamara, S., Moataz, T.: Breach-resistant structured encryption. In: Proceedings on Privacy Enhancing Technologies, vol. 2019, no. 1, pp. 245\u2013265 (2019)","DOI":"10.2478\/popets-2019-0014"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Asharov, G., Naor, M., Segev, G., and Shahaf, I. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In: Wichs, D., Mansour, Y. (eds.) 48th Annual ACM Symposium on Theory of Computing, 18\u201321 June 2016, pp. 1101\u20131114. ACM Press, Cambridge (2016)","DOI":"10.1145\/2897518.2897562"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-96884-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Asharov","year":"2018","unstructured":"Asharov, G., Segev, G., Shahaf, I.: Tight tradeoffs in searchable symmetric encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 407\u2013436. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_14"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","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), 1\u201337 (2021)","journal-title":"J. Cryptol."},{"key":"4_CR6","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"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.tcs.2008.09.023","volume":"409","author":"P Berenbrink","year":"2008","unstructured":"Berenbrink, P., Friedetzky, T., Hu, Z., Martin, R.: On weighted balls-into-bins games. Theor. Comput. Sci. 409(3), 511\u2013520 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"crossref","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: 24th Conference on Computer and Communications Security, 31 October\u20132 November 2017, pp. 1465\u20131482. ACM Press, Dallas (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"4_CR9","doi-asserted-by":"crossref","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: 23rd Conference on Computer and Communications Security, 24\u201328 October 2016, pp. 1143\u20131154. ACM Press, Vienna (2016)","DOI":"10.1145\/2976749.2978303"},{"key":"4_CR10","doi-asserted-by":"crossref","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: 13th Conference on Computer and Communications Security, 30 October\u20133 November 2006, pp. 79\u201388. ACM Press, Alexandria (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: Data structures and implementation. In: ISOC Network and Distributed System Security Symposium - NDSS 2014, 23\u201326 February 2014. The Internet Society, San Diego (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"4_CR12","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_CR13","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":"4_CR14","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":"4_CR15","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":"4_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 Technologies, vol. 2018, no. 1, pp. 5\u201320 (2018)","DOI":"10.1515\/popets-2018-0002"},{"key":"4_CR17","volume-title":"Urn Models and Their Application: An Approach to Modern Discrete Probability Theory","author":"NL Johnson","year":"1977","unstructured":"Johnson, N.L., Kotz, S.: Urn Models and Their Application: An Approach to Modern Discrete Probability Theory. Wiley, New York (1977)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Miers, I., Mohassel, P.: IO-DSSE: scaling dynamic searchable encryption to millions of indexes by improving locality. In: ISOC Network and Distributed System Security Symposium - NDSS 2017, 26 February\u20133 March 2017. The Internet Society, San Diego (2017)","DOI":"10.14722\/ndss.2017.23394"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Mishra, P., Poddar, R., Chen, J., Chiesa, A., Popa, R.A.: Oblix: an efficient oblivious search index. In: 2018 IEEE Symposium on Security and Privacy, 21\u201323 May 2018, pp. 279\u2013296. IEEE Computer Society Press, San Francisco (2018)","DOI":"10.1109\/SP.2018.00045"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"4_CR21","first-page":"255","volume":"9","author":"AW Richa","year":"2001","unstructured":"Richa, A.W., Mitzenmacher, M., Sitaraman, R.: The power of two random choices: a survey of techniques and results. Comb. Optim. 9, 255\u2013304 (2001)","journal-title":"Comb. Optim."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: the weighted case. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 256\u2013265 (2007)","DOI":"10.1145\/1250790.1250829"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/978-3-662-43948-7_81","volume-title":"Automata, Languages, and Programming","author":"K Talwar","year":"2014","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: a simple proof for the heavily loaded case. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 979\u2013990. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_81"},{"key":"4_CR24","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: 25th USENIX Security Symposium, 10\u201312 August 2016, pp. 707\u2013720. USENIX Association, Austin (2016)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15985-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:04:52Z","timestamp":1760133892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15985-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159848","9783031159855"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15985-5_4","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":"11 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}