{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:26:27Z","timestamp":1737523587994,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_76","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"939-950","source":"Crossref","is-referenced-by-count":14,"title":["Secure Games with Polynomial Expressions"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"76_CR1","unstructured":"Elwyn R. Berlekamp, Algebraic Coding Theory. McGraw-Hill, 1968."},{"key":"76_CR2","unstructured":"Elwyn R. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes. U.S. Patent, Number 4,633,470 1986."},{"key":"76_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of EURO-CRYPT2000","author":"D. Bleichenbacher","year":"2000","unstructured":"Daniel Bleichenbacher and Phong Nguyen, Noisy Polynomial Interpolation and Noisy Chinese Remaindering. In the Proceedings of EURO-CRYPT2000, Lecture Notes in Computer Science, Springer, 2000."},{"key":"76_CR4","unstructured":"Adam M. Brandeburger and Barry J. Nalebuff, Co-opetition, Doubleday Publications, 1996."},{"key":"76_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of EUROCRYPT\u2019 99","author":"C. Cachin","year":"1999","unstructured":"Christian Cachin, Silvio Micali, and Markus Stadler, Computationally Private Information Retrieval with Polylogarithmic Communication, In the Proceedings of EUROCRYPT\u2019 99, Lecture Notes in Computer Science, Springer, 1999."},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Benny Chor and Niv Gilboa, Computationally Private Information Retrieval, In the Proceedings of the 29th ACM Symposium on the Theory of Computing, 1997.","DOI":"10.1145\/258533.258609"},{"key":"76_CR7","unstructured":"Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan, Private Information Retrieval, In the Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995."},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin, Protecting Data Privacy in Private Information Retrieval Schemes, In the Proceedings of the 30th ACM Symposium on the Theory of Computing, 1998.","DOI":"10.1145\/276698.276723"},{"key":"76_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1086\/467953","volume":"24","author":"R. H. Gertner","year":"1995","unstructured":"Robert H. Gertner and Geoffrey P. Miller, Settlement Escrows, Journal of Legal Studies, Vol. 24, pp.87\u2013122, 1995.","journal-title":"Journal of Legal Studies"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Multi-party computations: Past and present. In PODC\u201997, pages 1\u20136. invited talk.","DOI":"10.1145\/259380.259405"},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Venkatesan Guruswami and Madhu Sudan, Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. In the Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998.","DOI":"10.1109\/SFCS.1998.743426"},{"key":"76_CR12","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali and Avi Wigderson, How to Play any Mental Game \u2014 A Completeness Theorem for Protocols with Honest Majority. In the Proceedings of the 19th ACMSymposium on the Theory of Computing, 1987.","DOI":"10.1145\/28395.28420"},{"key":"76_CR13","unstructured":"Oded Goldreich, Madhu Sudan and Ronitt Rubinfeld, Learning Polynomials with Queries: The Highly Noisy Case. In the Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995."},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Aggelos Kiayias and Moti Yung, Computationally Perfect Symmetric Encryption based on Polynomial Reconstruction, manuscript, 2001.","DOI":"10.1007\/3-540-45537-X_10"},{"key":"76_CR15","volume-title":"Use of Randomness in Algorithms and Protocols","author":"J. Kilian","year":"1990","unstructured":"Joe Kilian, Use of Randomness in Algorithms and Protocols. MIT Press, Cambridge, Massachusetts 1990."},{"key":"76_CR16","unstructured":"Eyal Kushilevitz amd Rafail Ostrovsky, Replication is not Needed: Single Database, Computationally-Private Information Retrieval, In the Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997."},{"key":"76_CR17","unstructured":"F. J. MacWilliams and N. Sloane, The Theory of Error Correcting Codes. North Holland, Amsterdam, 1977."},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Moni Naor and Benny Pinkas, Oblivious Transfer and Polynomial Evaluation. In the Proceedings of the 31th ACM Symposium on the Theory of Computing, 1999.","DOI":"10.1145\/301250.301312"},{"issue":"1","key":"76_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Madhu Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound. Journal of Complexity 13(1), pp. 180\u2013193, 1997.","journal-title":"Journal of Complexity"},{"key":"76_CR20","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao, How to Generate and Exchange Secrets. In the Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"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_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:40Z","timestamp":1737503380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_76","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}