{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:59:31Z","timestamp":1772906371032,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319294841","type":"print"},{"value":"9783319294858","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29485-8_6","type":"book-chapter","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T10:33:40Z","timestamp":1454322820000},"page":"90-107","source":"Crossref","is-referenced-by-count":39,"title":["Private Large-Scale Databases with Distributed Searchable Symmetric Encryption"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Steve","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Kiernan, J., Srikant, R., Yirong, X.: Order-preserving encryption for numeric data. In: SIGMOD Conference, pp. 563\u2013574 (2004)","DOI":"10.1145\/1007568.1007632"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"6_CR3","first-page":"624","volume":"2012","author":"A Boldyreva","year":"2012","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019Neill, A.: Order-preserving symmetric encryption. IACR Cryptology ePrint Archive 2012, 624 (2012)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6_CR4","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)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"6_CR7","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)"},{"key":"6_CR8","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.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442\u2013455. Springer, Heidelberg (2005)"},{"key":"6_CR9","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)"},{"key":"6_CR10","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41\u201350 (1995)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM CCS, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Dautrich, J., Ravishankar, C.: Combining ORAM with PIR to minimize bandwidth costs. In: ACM CODASPY, pp. 289\u2013296 (2015)","DOI":"10.1145\/2699026.2699117"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Fisch, B., Vo, B., Krell, F., Kumarasubramanian, A., Kolesnikov, V., Malkin, T., Bellovin, S.M.: Malicious-client security in blind seer: a scalable private DBMS. IACR Cryptology ePrint Archive, vol. 963, p. 2014 (2014)","DOI":"10.1109\/SP.2015.31"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"MJ Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR16","unstructured":"Goh, E.-J.: Secure indexes (2003)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: STOC, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"6_CR19","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)","journal-title":"J. ACM"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.-C., Steiner, M.: Outsourced symmetric private information retrieval. In: ACM CCS, pp. 875\u2013888 (2013)","DOI":"10.1145\/2508859.2516730"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","volume-title":"Financial Cryptography and Data Security","author":"Seny Kamara","year":"2013","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Financial Cryptography, pp. 258\u2013274 (2013)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-642-32946-3_21","volume-title":"Financial Cryptography and Data Security","author":"Kaoru Kurosawa","year":"2012","unstructured":"Kurosawa, K., Ohtaki, Y.: Uc-secure searchable symmetric encryption. In: Financial Cryptography, pp. 285\u2013298 (2012)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Mayberry, T., Blass, E.-O., Chan, A.H.: Efficient private file retrieval by combining ORAM and PIR. In: NDSS (2014)","DOI":"10.14722\/ndss.2014.23033"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: STOC, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R.: Efficient computation on oblivious RAMs. In: STOC, pp. 514\u2013523 (1990)","DOI":"10.1145\/100216.100289"},{"key":"6_CR27","unstructured":"Ostrovsky, R.: Software protection and simulation on oblivious RAMs. Ph.D. thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 1992"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/11535218_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R Ostrovsky","year":"2005","unstructured":"Ostrovsky, R., Skeith III, W.E.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 223\u2013240. Springer, Heidelberg (2005)"},{"key":"6_CR29","unstructured":"Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Nayak, K., Liu, C., T.-H., Chan, H., Shi, E., Stefanov, E., Huang, Y.: Oblivious data structures. In: ACM CCS, pp. 215\u2013226 (2014)","DOI":"10.1145\/2660267.2660314"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"6_CR32","first-page":"624","volume":"2014","author":"J Zhang","year":"2014","unstructured":"Zhang, J., Ma, Q., Zhang, W., Qiao, D.: KT-ORAM: a bandwidth-efficient ORAM built on k-ary tree of PIR nodes. IACR Cryptology ePrint Archive 2014, 624 (2014)","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology - CT-RSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29485-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T08:18:37Z","timestamp":1748765917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29485-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319294841","9783319294858"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29485-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}