{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:16Z","timestamp":1772276296491,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438649","type":"print"},{"value":"9783540454656","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_22","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"244-256","source":"Crossref","is-referenced-by-count":107,"title":["Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. of 8th PODC, pages 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. J. Cryptology, Springer-Verlag, (1991) 4: 75\u2013122.","journal-title":"J. Cryptology"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver. Minimal-latency secure function evaluation. EUROCRYPT 2000.","DOI":"10.1007\/3-540-45539-6_23"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. of CRYPTO\u2019 90, pages 62\u201376.","DOI":"10.1007\/3-540-38424-3_5"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. STOC, 1988.","DOI":"10.1145\/62212.62213"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In ICALP 2000.","DOI":"10.1007\/3-540-45022-X_43"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. J. of Cryptology, 13(1), 2000.","DOI":"10.1007\/s001459910006"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damgrard. Multiparty unconditionally secure protocols (extended abstract). In Proc. of 20th STOC, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damgrard. Secure distributed linear algebra in a constant number of rounds. In Proc. Crypto 2001.","DOI":"10.1007\/3-540-44647-8_7"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgrard, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT 2000.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient Multi-Party Computation over Rings. Manuscript, 2002.","DOI":"10.1007\/3-540-39200-9_37"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation (extended abstract). In Proc. of 26th STOC, pages 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. 33rd STOC, 2001.","DOI":"10.1145\/380752.380853"},{"key":"22_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-34799-2","volume-title":"CRYPTO\u2019 90","author":"S. Goldwasser","year":"1990","unstructured":"S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO\u2019 90, LNCS 537, Springer-Verlag, 1990."},{"key":"22_CR16","unstructured":"O. Goldreich. Secure multi-party computation. http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html , 2000."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Y Ishai and E. Kushilevitz. Private simultaneous messages protocols with applications. In Proc. of ISTCS\u2019 97,pp. 174\u2013183, 1997.","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Y Ishai and E. Kushilevitz. Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In Proc. of FOCS\u2019 00.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"J. Kilian. Basing cryptography on oblivious transfer. STOC\u2019 98, pp. 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In Prof. of Crypto\u2019 01.","DOI":"10.1007\/3-540-44647-8_10"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"S. Micali and P. Rogaway. Secure computation. In Proc. of CRYPTO\u2019 91.","DOI":"10.1007\/3-540-46766-1_32"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas, and R. Sumner. Privacy Preserving Auctions and Mechanism Design. In Proc. ACM Conference on Electronic Commerce 1999, pages 129\u2013139.","DOI":"10.1145\/336992.337028"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"T. Sandler, A. Young, and M. Yung. Non-interactive cryptocomputing for NC1. In Proc. of 40th FOCS, pages 554\u2013566, 1999.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for secure computations (extended abstract). In Proc. of FOCS 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"A. C. Yao. How to generate and exchange secrets. In Proc. of FOCS 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-45465-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:27:14Z","timestamp":1737052034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}