{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:32Z","timestamp":1725490412857},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_24","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"255-266","source":"Crossref","is-referenced-by-count":2,"title":["Constant-Round Private Database Queries"],"prefix":"10.1007","author":[{"given":"Nenad","family":"Dedic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Payman","family":"Mohassel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the k th -ranked element. In: Proc. of Eurocrypt (2004)","DOI":"10.1007\/978-3-540-24676-3_3"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Proc. of Eurocrypt (2001)","DOI":"10.1007\/3-540-44987-6_8"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/3-540-45022-X_43","volume-title":"Automata, Languages and Programming","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J., Kilian, J., Mueller, J.: One-round secure computation and secure autonomous mobile agents. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 512\u2013523. Springer, London, UK (2000)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Proc. of Eurocrypt, pp. 402\u2013414 (1999)","DOI":"10.1007\/3-540-48910-X_28"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C.: Single database private information retrieval with logarithmic communication. Cryptology ePrint Archive, Report 2004\/036 (2004)","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"24_CR6","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Technical Report TR CS0917, Department of Computer Science, Technion (1997)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proc. of FOCS, pp. 41\u201350 (1995)","DOI":"10.1109\/SFCS.1995.492461"},{"key":"24_CR8","unstructured":"Dedi\u0107, N., Reyzin, L., Russell, S.: Unpublished manuscript"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M.J. 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.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"24_CR10","volume-title":"Proc. ACM STOC","author":"Y. Gertner","year":"1998","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proc. ACM STOC, ACM Press, New York (1998)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography, vol. 2 (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"24_CR12","first-page":"218","volume-title":"Proceedings of 19th Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, Springer, Heidelberg (to appear)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: Proc. of FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"24_CR15","unstructured":"Lindell, Y., Pinkas, B.: A proof of Yao\u2019s protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004\/175 (2004)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: pot 33rd STOC, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"24_CR18","volume-title":"Proc. ACM STOC","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. ACM STOC, ACM Press, New York (1999)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, W.E.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 223\u2013240. Springer, Heidelberg (2005)"},{"key":"24_CR20","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. technical report tech. In: Technical Report Tech. Memo TR-81 (1981)"},{"key":"24_CR21","first-page":"554","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC 1. In: IEEE Symposium on Foundations of Computer Science, pp. 554\u2013567. IEEE Computer Society Press, Los Alamitos (1999)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:02Z","timestamp":1619503862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}