{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T13:19:22Z","timestamp":1771679962238,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"},{"value":"9783540741435","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74143-5_4","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T13:51:33Z","timestamp":1186667493000},"page":"50-67","source":"Crossref","is-referenced-by-count":127,"title":["Public Key Encryption That Allows PIR Queries"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"suffix":"III","given":"William E.","family":"Skeith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M. Abdalla","year":"2005","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. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 205\u2013222. Springer, Heidelberg (2005)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal Arguments and their Applications. In: IEEE Conference on Computational Complexity, pp. 194\u2013203 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Song, D., Waters, B.: New techniques for private stream searching. Technical Report CMU-CS-06-106, Carnegie Mellon University (March 2006)","DOI":"10.21236\/ADA456185"},{"issue":"7","key":"4_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: TCC, pp. 325\u2013341 (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., 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":"4_CR7","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proc. of CCS-2006, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chang, Y.C.: Single Database Private Information Retrieval with Logarithmic Communication. ACISP (2004)","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chang, Y.C., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: ACNS. Proc. of 3rd Applied Cryptography and Network Security Conference, pp. 442\u2013455 (2005)","DOI":"10.1007\/11496137_30"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/509907.509980","volume-title":"Proc. of the thiry-fourth annual ACM symposium on Theory of computing","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. of the thiry-fourth annual ACM symposium on Theory of computing, pp. 494\u2013503. ACM Press, New York (2002)"},{"key":"4_CR12","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private Information Retrieval by Keywords in Technical Report TR CS0917, Department of Computer Science, Technion (1998)"},{"key":"4_CR13","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proc. of the 36th Annu. IEEE Symp. on Foundations of Computer Science, pp. 41\u201351 (1995). Journal version: J. of the ACM 45, 965\u2013981 (1998)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single-database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, Springer, Heidelberg (2000)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"M. Freedman","year":"2005","unstructured":"Freedman, M., Ishai, Y., Pinkas, B., Reingold, O.: Keyword Search and Oblivious Pseudorandom Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, Springer, Heidelberg (2005)"},{"key":"4_CR16","unstructured":"Goh, E.J.: Secure indexes (2003), available at http:\/\/eprint.iacr.org\/2003\/216"},{"issue":"3","key":"4_CR17","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"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect Non-interactive Zero Knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006)"},{"issue":"1","key":"4_CR19","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. Comp. Sys. Sci.\u00a028(1), 270\u2013299 (1984)","journal-title":"J. Comp. Sys. Sci."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-28628-8_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Katz","year":"2004","unstructured":"Katz, J., Ostrovsky, R.: Round-Optimal Secure Two-Party Computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 335\u2013354. Springer, Heidelberg (2004)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In: Proc. of STOC 1992, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"issue":"2-3","key":"4_CR22","first-page":"356","volume":"20","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Ogata, W.: Oblivious Keyword Search. Journal of Complexity (Special issue on coding and cryptography)\u00a020(2-3), 356\u2013371 (2004)","journal-title":"Journal of Complexity (Special issue on coding and cryptography)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/SFCS.1997.646125","volume-title":"Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science, pp. 364\u2013373. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: An Oblivious Transfer Protocal with Log-Squared Communication. IACR ePrint Cryptology Archive 2004\/063","DOI":"10.1007\/11556992_23"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Ostrovsky","year":"2005","unstructured":"Ostrovsky, R., Skeith, W.: Private Searching on Streaming Data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"4_CR26","unstructured":"Ostrovsky, R., Skeith, W.: Algebraic Lower Bounds for Computing on Encrypted Data. In: Electronic Colloquium on Computational Complexity, ECCC TR07-22"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Public Key Cryptology (PKC-2007)","author":"R. Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Skeith, W.: A Survey of Single Database PIR: Techniques and Applications. In: Proceedings of Public Key Cryptology (PKC-2007). LNCS, Springer-Verlag\/IACR, Heidelberg (2007)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-Interactive CryptoComputing For NC1. In: FOCS 1999, pp. 554\u2013567 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"4_CR29","first-page":"44","volume-title":"Proc. of IEEE Symposium on Security and Privacy","author":"D.X. Song","year":"2000","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical Techniques for Searches on Encrypted Data. In: Proc. of IEEE Symposium on Security and Privacy, pp. 44\u201355. IEEE Computer Society Press, Los Alamitos (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:40:38Z","timestamp":1737355238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540741428","9783540741435"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}