{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:16:31Z","timestamp":1773317791061,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007396","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"262-271","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":165,"title":["Batch codes and their applications"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[{"name":"Technion"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[{"name":"Technion"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"UCLA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28410"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646506.694190"},{"key":"e_1_3_2_1_4_1","first-page":"261","volume-title":"Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS","author":"Beimel A.","year":"2002","unstructured":"A. Beimel , Y. Ishai , E. Kushilevitz , and J. -F. Raymond . Breaking the O(n1\/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS , pages 261 -- 270 , 2002 .]] A. Beimel, Y. Ishai, E. Kushilevitz, and J. -F. Raymond. Breaking the O(n1\/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261--270, 2002.]]"},{"key":"e_1_3_2_1_5_1","first-page":"56","volume-title":"Proc. CRYPTO 2000","author":"Beimel A.","year":"1880","unstructured":"A. Beimel , Y. Ishai , and T. Malkin . Reducing the servers' computation in private information retrieval: PIR with preprocessing . In Proc. CRYPTO 2000 , LNCS 1880 , pages 56 -- 74 . To appear in Journal of Cryptology.]] A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers' computation in private information retrieval: PIR with preprocessing. In Proc. CRYPTO 2000, LNCS 1880, pages 56--74. To appear in Journal of Cryptology.]]"},{"key":"e_1_3_2_1_6_1","first-page":"402","volume-title":"Proc. EUROCRYPT '99","author":"Cachin C.","unstructured":"C. Cachin , S. Micali , and M. Stadler . Computationally private information retrieval with polylogarithmic communication . In Proc. EUROCRYPT '99 , LNCS 1592, pages 402 -- 414 .]] C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Proc. EUROCRYPT '99, LNCS 1592, pages 402--414.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384047"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796270"},{"key":"e_1_3_2_1_10_1","volume-title":"Manuscript","author":"Chor B.","year":"1998","unstructured":"B. Chor , N. Gilboa , and M. Naor Private information retrieval by keywords . Manuscript , 1998 .]] B. Chor, N. Gilboa, and M. Naor Private information retrieval by keywords. Manuscript, 1998.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756183"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684251"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711408"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723"},{"key":"e_1_3_2_1_16_1","volume-title":"February","author":"Goldreich O.","year":"1999","unstructured":"O. Goldreich . Secure multi-party computation. Available at http:\/\/philby. ucsb. edu\/cryptolib\/BOOKS , February 1999 .]] O. Goldreich. Secure multi-party computation. Available at http:\/\/philby. ucsb. edu\/cryptolib\/BOOKS, February 1999.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796363"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_1_22_1","volume-title":"North-Holland","author":"MacWilliams F. J.","year":"1977","unstructured":"F. J. MacWilliams and N. J. Sloane . The Theory of Error Correcting Codes . North-Holland , Amsterdam , 1977 .]] F. J. MacWilliams and N. J. Sloane. The Theory of Error Correcting Codes. North-Holland, Amsterdam, 1977.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_1_25_1","first-page":"573","volume-title":"Proc. CRYPTO '99","author":"Naor M.","unstructured":"M. Naor and B. Pinkas . Oblivious transfer with adaptive queries . In Proc. CRYPTO '99 , LNCS 1666, pages 573 -- 590 .]] M. Naor and B. Pinkas. Oblivious transfer with adaptive queries. In Proc. CRYPTO '99, LNCS 1666, pages 573--590.]]"},{"key":"e_1_3_2_1_26_1","volume-title":"Harvard Aiken Computation Laboratory","author":"Rabin M. O.","year":"1981","unstructured":"M. O. Rabin . How to exchange secrets by oblivious transfer. Technical report TR-81 , Harvard Aiken Computation Laboratory , 1981 .]] M. O. Rabin. How to exchange secrets by oblivious transfer. Technical report TR-81, Harvard Aiken Computation Laboratory, 1981.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875581"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301397"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380790"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875580"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA","acronym":"STOC04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007396","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":33,"alternative-id":["10.1145\/1007352.1007396","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007396","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}