{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:10:45Z","timestamp":1773155445776,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642155451","type":"print"},{"value":"9783642155468","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15546-8_7","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T09:00:37Z","timestamp":1283936437000},"page":"87-100","source":"Crossref","is-referenced-by-count":115,"title":["Computationally Efficient Searchable Symmetric Encryption"],"prefix":"10.1007","author":[{"given":"Peter","family":"van Liesdonk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Sedghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"Doumen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Hartel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem","family":"Jonker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M. Abdalla","year":"2008","unstructured":"Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. J. Cryptology\u00a021(3), 350\u2013391 (2008)","journal-title":"J. Cryptology"},{"key":"7_CR2","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. Cryptology ePrint Archive, Report 2005\/191 (2005), http:\/\/eprint.iacr.org\/"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes [16], pp. 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"7_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.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith III, W.E.: Public key encryption that allows PIR queries. In: Menezes [16], pp. 50\u201367","DOI":"10.1007\/978-3-540-74143-5_4"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","first-page":"442","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.\u00a03531, pp. 442\u2013455. Springer, Heidelberg (2005)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: STOC, pp. 304\u2013313 (1997)","DOI":"10.1145\/258533.258609"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM\u00a045(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"7_CR9","first-page":"79","volume-title":"ACM Conference on Computer and Communications Security","author":"R. Curtmola","year":"2006","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 Conference on Computer and Communications Security, pp. 79\u201388. ACM, New York (2006)"},{"key":"7_CR10","unstructured":"Goh, E.-J.: Secure indexes. Cryptology ePrint Archive, Report 2003\/216 (2003), http:\/\/eprint.iacr.org\/"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"issue":"3","key":"7_CR12","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\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR14","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"},{"issue":"11","key":"7_CR15","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/358790.358797","volume":"24","author":"L. Lamport","year":"1981","unstructured":"Lamport, L.: Password authentification with insecure communication. Commun. ACM\u00a024(11), 770\u2013772 (1981)","journal-title":"Commun. ACM"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2007","year":"2007","unstructured":"Menezes, A. (ed.): CRYPTO 2007. LNCS, vol.\u00a04622. Springer, Heidelberg (2007)"},{"key":"7_CR17","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"},{"key":"7_CR18","first-page":"519","volume-title":"ACM Conference on Computer and Communications Security","author":"J.R. Troncoso-Pastoriza","year":"2007","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.U.: Privacy preserving error resilient dna searching through oblivious automata. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM Conference on Computer and Communications Security, pp. 519\u2013528. ACM, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Secure Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15546-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T16:55:08Z","timestamp":1740502508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15546-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155451","9783642155468"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15546-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}