{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:53:14Z","timestamp":1775584394167,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_74","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"912-926","source":"Crossref","is-referenced-by-count":76,"title":["Information-Theoretic Private Information Retrieval: A Unified Construction"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"74_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-63165-8_196","volume-title":"Proc. of the 24th ICALP","author":"A. Ambainis","year":"1997","unstructured":"A. Ambainis. Upper bound on the communication complexity of private information retrieval. In Proc. of the 24th ICALP, vol. 1256 of LNCS, pp. 401\u2013407. 1997."},{"key":"74_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/10719839_21","volume-title":"LATIN 2000","author":"A. Ambainis","year":"2000","unstructured":"A. Ambainis and S. Lokam. Improved upper bounds on the simultaneous messages complexity of the generalized addressing function. In LATIN 2000, vol. 1776 of LNCS, pp. 207\u2013216. 2000."},{"key":"74_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-59042-0_88","volume-title":"12th STOC","author":"L. Babai","year":"1995","unstructured":"L. Babai, P. G. Kimmel, and S. V. Lokam. Simultaneous messages vs. communication. In 12th STOC, vol. 900 of LNCS, pp. 361\u2013372. 1995."},{"key":"74_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"STACS\u2019 90","author":"D. Beaver","year":"1990","unstructured":"D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In STACS\u2019 90, vol. 415 of LNCS, pp. 37\u201348. 1990."},{"issue":"1","key":"74_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001459900017","volume":"10","author":"D. Beaver","year":"1997","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: Improvements and applications. J. of Cryptology, 10(1):17\u201336. 1997.","journal-title":"J. of Cryptology"},{"key":"74_CR6","doi-asserted-by":"crossref","unstructured":"A. Beimel and Y. Ishai. Information-Theoretic Private Information Retrieval: A Unified Construction. TR01-15, Electronic Colloquium on Computational Complexity. 2001.","DOI":"10.1007\/3-540-48224-5_74"},{"key":"74_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-44598-6_4","volume-title":"CRYPTO 2000","author":"A. Beimel","year":"2000","unstructured":"A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers\u2019 computation in private information retrieval: PIR with preprocessing. In CRYPTO 2000, vol. 1880 of LNCS, pp. 56\u201374. 2000."},{"key":"74_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"CRYPTO\u2019 88","author":"J. Benaloh","year":"1990","unstructured":"J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In CRYPTO\u2019 88, vol. 403 of LNCS, pp. 27\u201335. 1990."},{"key":"74_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"EUROCRYPT\u2019 99","author":"C. Cachin","year":"1999","unstructured":"C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT\u2019 99, vol. 1592 of LNCS, 402\u2013414. 1999."},{"key":"74_CR10","doi-asserted-by":"crossref","unstructured":"B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of the 29th STOC, pp. 304\u2013313. 1997.","DOI":"10.1145\/258533.258609"},{"key":"74_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. J. of the ACM, 45:965\u2013981. 1998.","journal-title":"J. of the ACM"},{"issue":"1","key":"74_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001450010008","volume":"14","author":"G. Di-Crescenzo","year":"2001","unstructured":"G. Di-Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for private information retrieval. J. of Cryptology, 14(1):37\u201374. 2001.","journal-title":"J. of Cryptology"},{"issue":"3","key":"74_CR13","first-page":"592","volume":"60","author":"Y. Gertner","year":"2000","unstructured":"Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. JCSS, 60(3):592\u2013629. 2000.","journal-title":"JCSS"},{"key":"74_CR14","unstructured":"O. Goldreich and L. Trevisan. On the length of linear error-correcting codes having a 2-query local decoding procedure. Manuscript, 2000."},{"key":"74_CR15","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Improved upper bounds on information theoretic private information retrieval. In Proc. of the 31th STOC, pp. 79\u201388. 1999.","DOI":"10.1145\/301250.301275"},{"key":"74_CR16","first-page":"99","volume":"87","author":"M. Ito","year":"1987","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. of Globecom 87, pp. 99\u2013102. 1987.","journal-title":"Proc. of Globecom"},{"key":"74_CR17","unstructured":"H. Karloff and L. Schulman. Manuscript, 2000."},{"key":"74_CR18","doi-asserted-by":"crossref","unstructured":"J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. of the 32th STOC, pp. 80\u201386. 2000.","DOI":"10.1145\/335305.335315"},{"key":"74_CR19","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. of the 38th FOCS, pp. 364\u2013373. 1997.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"74_CR20","series-title":"Master\u2019s thesis","volume-title":"Private access to distributed information","author":"E. Mann","year":"1998","unstructured":"E. Mann. Private access to distributed information. Master\u2019s thesis, Technion-Israel Institute of Technology, Haifa, 1998."},{"key":"74_CR21","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. CACM, 22:612\u2013613. 1979.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:30Z","timestamp":1556936910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}