{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:53:04Z","timestamp":1775584384217,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540004202","type":"print"},{"value":"9783540364139","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36413-7_24","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:44:57Z","timestamp":1184600697000},"page":"326-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Robust Information-Theoretic Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Yoav","family":"Stahl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"24_CR1","first-page":"41","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS. (1995) 41\u201351. J. version: JACM, 45:965-981, 1998.","journal-title":"J. version: JACM"},{"key":"24_CR2","unstructured":"Ishai, Y., Kushilevitz, E.: Improved upper bounds on information theoretic private information retrieval. In: 31st STOC. (1999) 79\u201388"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-63165-8_196","volume-title":"Upper bound on the communication complexity of private information retrieval","author":"A. Ambainis","year":"1997","unstructured":"Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: 24th ICALP. Vol. 1256 of LNCS. (1997) 401\u2013407"},{"key":"24_CR4","first-page":"11","volume":"E82-A","author":"T. Itoh","year":"1999","unstructured":"Itoh, T.: Efficient private information retrieval. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences E82-A (1999) 11\u201320","journal-title":"IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1007\/3-540-48224-5_74","volume-title":"Information-theoretic private information retrieval: A unified construction","author":"A. Beimel","year":"2001","unstructured":"Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: A unified construction. In: 28th ICALP. Vol. 2076 of LNCS. (2001) 912\u2013926"},{"key":"24_CR6","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the O(n1\/2k-1 ) barrier for inforamtion-theoretic private information retrieval. In: 43rd FOCS. (2002) To Appear."},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"STACS\u2019 90","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: STACS\u2019 90. Vol. 415 of LNCS. (1990) 37\u201348"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001459900017","volume":"10","author":"D. Beaver","year":"1997","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Locally random reductions: Improvements and applications. J. of Cryptology 10 (1997) 17\u201336","journal-title":"J. of Cryptology"},{"key":"24_CR9","unstructured":"Stahl, Y.: Robust information-theoretic private information retrieval. Master\u2019s thesis, Ben-Gurion University, Beer-Sheva (2002)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Data structures and Algorithms. Volume 1. Sorting and Searching. Springer-Verlag (1984)","DOI":"10.1007\/978-3-642-69672-5"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/S0895480190283595","volume":"8","author":"I. Newman","year":"1995","unstructured":"Newman, I., Wigderson, A.: Lower bounds on formula size of Boolean functions using hypergraph entropy. SIAM J. on Discrete Mathematics 8 (1995) 536\u2013542","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N. Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16 (1996) 434\u2013449","journal-title":"Algorithmica"},{"key":"24_CR13","first-page":"44","volume":"403","author":"S.R. Blackburn","year":"1999","unstructured":"Blackburn, S.R.: Combinatorial designs and their applications. Research Notes in Mathematics 403 (1999) 44\u201370","journal-title":"Research Notes in Mathematics"},{"key":"24_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"EUROCRYPT\u2019 96","author":"S.R. Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In EUROCRYPT\u2019 96. Volume 1070 of LNCS. (1996) 107\u2013118"},{"key":"24_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"CRYPTO\u2019 93","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In CRYPTO\u2019 93. Volume 773 of LNCS. (1994) 480\u2013491"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D. Stinson","year":"2000","unstructured":"Stinson, D., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. of Statistical Planning and Inference 86(2) (2000) 595\u2013617","journal-title":"J. of Statistical Planning and Inference"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58 (1986) 191\u2013193","journal-title":"Discrete Math"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.D.: Some recursive constructions for perfect hash families. J. Combin. Des. 4 (1996) 353\u2013363","journal-title":"J. Combin. Des"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jcta.1999.3050","volume":"92","author":"S.R. Blackburn","year":"2000","unstructured":"Blackburn, S.R.: Perfect hash families: Probabilistic methods and explicit constructions. J. of Combin. Theory-Series A 92 (2000) 54\u201360","journal-title":"J. of Combin. Theory-Series A"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1006\/jcta.1998.2876","volume":"83","author":"S.R. Blackburn","year":"1998","unstructured":"Blackburn, S.R., Wild, P.R.: Optimal linear perfect hash families. J. Combinatorial Theory 83 (1998) 233\u2013250","journal-title":"J. Combinatorial Theory"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Komlos, J.: On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Discrete Methods 5 (1984) 61\u201368","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0195-6698(88)80048-9","volume":"9","author":"J. Korner","year":"1988","unstructured":"Korner, J., Marton: New bounds for perfect hashing via information theory. European J. Combin. 9 (1988) 523\u2013530","journal-title":"European J. Combin"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A","volume":"8","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: New constructions for perfect hash families and related structures using combinatorial designs and codes. J. of Combinatorial Designs 8 (2000) 189\u2013200","journal-title":"J. of Combinatorial Designs"},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"Z.J. Czech","year":"1997","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Perfect hashing. Theoretical Computer Science 182 (1997) 1\u2013143","journal-title":"Theoretical Computer Science"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. CACM 22 (1979) 612\u2013613","journal-title":"CACM"},{"key":"24_CR26","unstructured":"Slot, C., van Emde Boas, P.: On tape versus core; an application of space efficient perfect hash functions to the invariance of space. In: 16thSTOC. (1984) 391\u2013400"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"24_CR28","first-page":"300","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. SIAM 8 (1960) 300\u2013304","journal-title":"J. SIAM"},{"key":"24_CR29","unstructured":"Macwilliams, F.R., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Mathematical library. North-Holland (1978)"}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36413-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T05:09:53Z","timestamp":1609909793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36413-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004202","9783540364139"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36413-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}