{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:16:15Z","timestamp":1742987775845,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004202"},{"type":"electronic","value":"9783540364139"}],"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"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","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_1","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:44:57Z","timestamp":1184600697000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Applications of Polynomials for the Design of Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Kushilevitz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"1_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-63165-8_196","volume-title":"24th ICALP","author":"A. Ambainis","year":"1997","unstructured":"A. Ambainis. Upper bound on the communication complexity of private information retrieval. In 24th ICALP, LNCS 1256, pp. 401\u2013407, 1997."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM PODC, pages 201\u2013209. ACM, 1989.","DOI":"10.1145\/72981.72995"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. 22nd STOC, pages 503\u2013513. ACM, 1990.","DOI":"10.1145\/100216.100287"},{"key":"1_CR4","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":"A. Beimel and Y. Ishai. Information-theoretic private information retrieval: A unified construction. In 28th ICALP, vol. 2076 of LNCS, pp. 912\u2013926, 2001."},{"key":"1_CR5","unstructured":"A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond, \u201cBreaking the O(n 1\/(2 k -1) Barrier for Information-Theoretic Private Information Retrieval\u201d, In Proc. of FOCS, 2002."},{"key":"1_CR6","series-title":"Lect Notes Comput Sci","first-page":"56","volume-title":"Reducing the servers\u2019 computation in private information retrieval: PIR with preprocessing","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 ofLNCS, pp. 56\u201374, 2000."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. Proc. 20th STOC88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung Perfectly-Secure Key Distribution for Dynamic Conferences. Proc. CRYPTO 1992, 471\u2013486","DOI":"10.1007\/3-540-48071-4_33"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Ishai, R. Kumar, M. K. Reiter, R. Rubinfeld, and R. N. Wright. Selective private function evaluation with applications to private statistics. In 20th PODC, pp. 293\u2013304, 2001.","DOI":"10.1145\/383962.384047"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th STOC88, pages 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"B. Chor and N. Gilboa. Computationally private information retrieval. In 29th STOC, pp. 304\u2013313, 1997.","DOI":"10.1145\/258533.258609"},{"key":"1_CR12","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":"1_CR13","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"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation (extended abstract). In Proc. 26th STOC, pages 554\u2013563. ACM, 1994.","DOI":"10.1145\/195058.195408"},{"key":"1_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Secure multiparty computation of approximations","author":"J. Feigenbaum","year":"2001","unstructured":"J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. In 28th ICALP, vol. 2076 of LNCS, pp. 927\u2013938, 2001."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. On 2-Round Secure Multiparty Computation. In Proc. of Crypto, 2002.","DOI":"10.1007\/3-540-45708-9_12"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. O. Rabin, and T. Rabin. Fact-track multiparty computations with applications to threshold cryptography. In Proc. of 17th PODC, pages 101\u2013111, 1998.","DOI":"10.1145\/277697.277716"},{"key":"1_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-49543-6_17","volume-title":"A random server model for private information retrieval","author":"Y. Gertner","year":"1998","unstructured":"Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for private information retrieval. In RANDOM\u2019 98, vol. 1518 of LNCS, pp. 200\u2013217, 1998."},{"issue":"3","key":"1_CR19","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":"1_CR20","unstructured":"S.W. Golub, \u201cShift Register Sequences\u201d, 1967."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proc. 19th STOC, pages 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"1_CR22","unstructured":"Y. Ishai and E. Kushilevitz. Private simultaneous messages protocols with applications. In ISTCS97, pages 174\u2013184, 1997."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Improved upper bounds on information theoretic private information retrieval. 31st STOC, pp. 79\u201388, 1999.","DOI":"10.1145\/301250.301275"},{"key":"1_CR24","unstructured":"Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, 2000."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In Proc. ICALP\u2019 02, pp. 244\u2013256.","DOI":"10.1007\/3-540-45465-9_22"},{"key":"1_CR26","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In Proc. IEEE Global Telecommunication Conf., Globecom 87, pages 99\u2013102, 1987."},{"issue":"1","key":"1_CR27","first-page":"11","volume":"E82-A","author":"T. Itoh","year":"1999","unstructured":"T. Itoh. Efficient private information retrieval. IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci., E82-A(1):11\u201320, 1999.","journal-title":"IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"J. Katz and L. Trevisan. On the efficiency of local decoding procedures for errorcorrecting codes. In 32nd STOC, pp. 80\u201386, 2000.","DOI":"10.1145\/335305.335315"},{"key":"1_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1007\/3-540-48224-5_76","volume-title":"Secure games with polynomial expressions","author":"A. Kiayias","year":"2001","unstructured":"A. Kiayias and M. Yung. Secure games with polynomial expressions. In 28th ICALP, vol. 2076 of LNCS, pp. 939\u2013950, 2001."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"A. Kiayias and M. Yung. Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. In 29th ICALP, pp. 232\u2013243, 2002.","DOI":"10.1007\/3-540-45465-9_21"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In 38th FOCS, pp. 364\u2013373, 1997.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"1_CR32","unstructured":"E. Mann. Private access to distributed information. Master\u2019s thesis, Technion, Haifa, 1998."},{"key":"1_CR33","unstructured":"F.J. Macwilliams and N.J.A. Sloane, \u201cThe Theory of Error Correcting Codes\u201d, 1977."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In 33th STOC, 2001.","DOI":"10.1145\/380752.380855"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In 31st STOC, pp. 245\u2013254, 1999.","DOI":"10.1145\/301250.301312"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and V. Shoup. Private information storage. In 29th STOC, pp. 294\u2013303, 1997.","DOI":"10.1145\/258533.258606"},{"issue":"8","key":"1_CR37","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1145\/361082.361089","volume":"17","author":"G.B. Purdy","year":"1974","unstructured":"G.B. Purdy, \u201cA high Security Log-In Procedure\u201d, CACM 17(8), pp. 442\u2013445, 1974.","journal-title":"CACM"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"38","author":"M. O. Rabin","year":"1989","unstructured":"M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 38, 335\u2013348 (1989).","journal-title":"J. ACM"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73\u201385. ACM, 1989.","DOI":"10.1145\/73007.73014"},{"issue":"6","key":"1_CR40","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Commun. ACM, 22(6):612\u2013613, June 1979.","journal-title":"Commun. ACM"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"A. C-C. Yao. How to Generate and Exchange Secrets. In Proc. 27th FOCS, pages 162\u2013167. IEEE, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:33:33Z","timestamp":1737286413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36413-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004202","9783540364139"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-36413-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}