{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:44Z","timestamp":1781078264078,"version":"3.54.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2010,4]]},"abstract":"<jats:p>Cryptographic protocols safeguard the privacy of user queries to public databases.<\/jats:p>","DOI":"10.1145\/1721654.1721674","type":"journal-article","created":{"date-parts":[[2010,3,30]],"date-time":"2010-03-30T12:32:23Z","timestamp":1269952343000},"page":"68-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":119,"title":["Private information retrieval"],"prefix":"10.1145","volume":"53","author":[{"given":"Sergey","family":"Yekhanin","sequence":"first","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"407","volume":"401","author":"Ambainis A.","year":"1997","unstructured":"Ambainis , A. Upper bound on the communication complexity of private information retrieval. In Proceedings of the Automata, Languages and Programming, 24th International Colloquium LNCS 1256 (Bologna, Italy , July 7--11). Springer , 1997 , 401 -- 407 . Ambainis, A. Upper bound on the communication complexity of private information retrieval. In Proceedings of the Automata, Languages and Programming, 24th International Colloquium LNCS 1256 (Bologna, Italy, July 7--11). Springer, 1997, 401--407.","journal-title":"Springer"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"e_1_2_1_4_1","first-page":"270","volume":"261","author":"Beimel A.","year":"2002","unstructured":"Beimel , A. , Ishai , Y. , Kushilevitz , E. , and Raymond , J.F. Breaking the O (n1\/(2k&minus;1)) barrier for information-theoretic private information retrieval. In Proceedings of the 43rd Symposium on Foundations of Computer Science (Vancouver, B.C., Nov . 16--19). IEEE Computer Society , 2002 , 261 -- 270 . Beimel, A., Ishai, Y., Kushilevitz, E., and Raymond, J.F. Breaking the O (n1\/(2k&minus;1)) barrier for information-theoretic private information retrieval. In Proceedings of the 43rd Symposium on Foundations of Computer Science (Vancouver, B.C., Nov. 16--19). IEEE Computer Society, 2002, 261--270.","journal-title":"IEEE Computer Society"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.704119"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756163"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536422"},{"key":"e_1_2_1_9_1","unstructured":"Gasarch W. Web page on private information retrieval; http:\/\/www.cs.umd.edu\/gasarch\/pir\/pir.html  Gasarch W. Web page on private information retrieval; http:\/\/www.cs.umd.edu\/gasarch\/pir\/pir.html"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"e_1_2_1_12_1","volume-title":"New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems E93-D, 2","author":"Itoh T.","year":"2010","unstructured":"Itoh , T. and Suzuki , Y . New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems E93-D, 2 ( 2010 ), 263--270. Itoh, T. and Suzuki, Y. New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems E93-D, 2 (2010), 263--270."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.007"},{"key":"e_1_2_1_15_1","first-page":"373","volume":"364","author":"Kushilevitz E.","year":"1997","unstructured":"Kushilevitz , E. and Ostrovsky , R. Replication is not needed: Single-database computationally private information. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami Beach, FL, Oct . 19--22). IEEE Computer Society , 1997 , 364 -- 373 . Kushilevitz, E. and Ostrovsky, R. Replication is not needed: Single-database computationally private information. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami Beach, FL, Oct. 19--22). IEEE Computer Society, 1997, 364--373.","journal-title":"IEEE Computer Society"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11556992_23"},{"key":"e_1_2_1_17_1","first-page":"411","volume":"393","author":"Ostrovsky R.","year":"2007","unstructured":"Ostrovsky , R. and Sketch , W.E. III A survey of single database private information retrieval: Techniques and applications. In Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography LNCS 4450 (Beijing, Apr . 16--20). Springer , 2007 , 393 -- 411 . Ostrovsky, R. and Sketch, W.E. III A survey of single database private information retrieval: Techniques and applications. In Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography LNCS 4450 (Beijing, Apr. 16--20). Springer, 2007, 393--411.","journal-title":"Springer"},{"key":"e_1_2_1_20_1","first-page":"347","volume":"13","author":"Trevisan L.","year":"2004","unstructured":"Trevisan , L. Some applications of coding theory in computational complexity. Quaderni di Matematica 13 ( 2004 ), 347 -- 424 . Trevisan, L. Some applications of coding theory in computational complexity. Quaderni di Matematica 13 (2004), 347--424.","journal-title":"Matematica"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_115"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/06065773X"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721654.1721674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1721654.1721674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:38Z","timestamp":1750249418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721654.1721674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["10.1145\/1721654.1721674"],"URL":"https:\/\/doi.org\/10.1145\/1721654.1721674","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]},"assertion":[{"value":"2010-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}