{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T11:11:11Z","timestamp":1789902671126,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540140399","type":"print"},{"value":"9783540392002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-39200-9_37","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:35:32Z","timestamp":1187235332000},"page":"596-613","source":"Crossref","is-referenced-by-count":52,"title":["Efficient Multi-party Computation over Rings"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. of 8th PODC, pp. 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"37_CR2","series-title":"Lect Notes Comput Sci","first-page":"420","volume-title":"Proc. of CRYPTO\u2019 91","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Efficient multiparty protocols using circuit randomization. In Proc. of CRYPTO\u2019 91, LNCS 576, pp. 420\u2013432, 1991."},{"key":"37_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Proc. of EUROCRYPT\u2019 00","author":"D. Beaver","year":"2000","unstructured":"D. Beaver. Minimal-latency secure function evaluation. In Proc. of EUROCRYPT\u2019 00, LNCS 1807, pp. 335\u2013350, 2000."},{"key":"37_CR4","series-title":"Lect Notes Comput Sci","first-page":"62","volume-title":"Proc. of CRYPTO\u2019 90","author":"D. Beaver","year":"1990","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO\u2019 90, LNCS 537, pp. 62\u201376, 1990."},{"key":"37_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, pp. 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"J. of Cryptology"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. of 42nd FOCS, pp. 136\u2013145, 2001.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively secure computation. In Proc. of 28th STOC, pp. 639\u2013648, 1996.","DOI":"10.1145\/237814.238015"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damg\u00e5rd. Multiparty unconditional secure protocols. In Proc. of 20th STOC, pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proc. of 27th ICALP, pp. 512\u2013523, 2000.","DOI":"10.1007\/3-540-45022-X_43"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01200059","volume":"1","author":"R. Cleve","year":"1991","unstructured":"R. Cleve. Towards Optimal Simulations of Formulas by Bounded-Width Programs. In Computational Complexity 1: 91\u2013105, 1991.","journal-title":"Computational Complexity"},{"key":"37_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Proc. of EUROCRYPT\u2019 00","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, I. Damg\u00e5rd, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT\u2019 00, LNCS 1807, pp. 316\u2013334, 2000."},{"key":"37_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Proc. of EUROCRYPT\u2019 01","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of EUROCRYPT\u2019 01, LNCS 2045, pp. 280\u2013299, 2001."},{"key":"37_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"Proc. of CRYPTO\u2019 02","author":"R. Cramer","year":"2002","unstructured":"R. Cramer and S. Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Proc. of CRYPTO\u2019 02, LNCS 2442, 272\u2013287, 2002."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. Cryptology ePrint Archive, Report 2003\/030, 2003.","DOI":"10.1007\/3-540-39200-9_37"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. of 26th STOC, pp. 522\u2013533, 1994.","DOI":"10.1145\/195058.195405"},{"issue":"4","key":"37_CR18","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. G. Desmedt","year":"1994","unstructured":"Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite Abelian group. In SIAM Journal on Discrete Mathematics, 7(4):667\u2013679, 1994.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"37_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0055724","volume-title":"Proc. of CRYPTO\u2019 98","author":"M. Fitzi","year":"1998","unstructured":"M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Proc. of CRYPTO\u2019 98, LNCS 1462, pp. 121\u2013136, 1998."},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. of 26th STOC, pp. 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"37_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Proc. of DISC\u2019 98","author":"M. Fitzi","year":"1998","unstructured":"M. Fitzi and U. Maurer Efficient Byzantine agreement secure against general adversaries. In Proc. of DISC\u2019 98, LNCS 1499, pp. 134\u2013148, 1998."},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung. Communication complexity of secure computation. In Proc. of 24th STOC, pp. 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. of 17th PODC, pp. 101\u2013111, 1998.","DOI":"10.1145\/277697.277716"},{"key":"37_CR24","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, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In Proc. of 16th PODC, 1997, pp. 25\u201334.","DOI":"10.1145\/259380.259412"},{"key":"37_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Proc. of CRYPTO\u2019 01","author":"M. Hirt","year":"2001","unstructured":"M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In Proc. of CRYPTO\u2019 01, LNCS 2139, pp. 101\u2013118, 2001."},{"key":"37_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Proc. of ASIACRYPT\u2019 00","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In Proc. of ASIACRYPT\u2019 00, LNCS 1976, pp. 143\u2013161, 2000."},{"key":"37_CR28","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 41th FOCS, pp. 294\u2013304, 2000.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. of 29th ICALP, pp. 244\u2013256, 2002.","DOI":"10.1007\/3-540-45465-9_22"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In Proc. of 8th Conference on Structure in Complexity Theory, pp. 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"J. Kilian. Founding cryptography on oblivious transfer. In Proc. of 20th STOC, pp. 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"37_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Proc. of CRYPTO\u2019 01","author":"Y. Lindell","year":"2001","unstructured":"Y. Lindell. Parallel coin-tossing and constant-round secure two-party Computation. In Proc. of CRYPTO\u2019 01, LNCS 2139, pp. 171\u2013189, 2001."},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"M. Naor, and K. Nissim. Communication Preserving Protocols for Secure Function Evaluation. In Proc. of 33rd STOC, pp. 590\u2013599, 2001.","DOI":"10.1145\/380752.380855"},{"key":"37_CR34","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. of 10th PODC, pp. 51\u201359, 1991.","DOI":"10.1145\/112600.112605"},{"key":"37_CR35","doi-asserted-by":"crossref","unstructured":"T. Sandler, A. Young, and M. Yung. Non-interactive cryptocomputing for NC1. In Proc. of 40th FOCS, pp. 554\u2013567, 1999.","DOI":"10.1109\/SFFCS.1999.814630"},{"issue":"11","key":"37_CR36","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(11):612\u2013613, 1979.","journal-title":"CACM"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for secure computations. In Proc. of 23th FOCS, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"A. C. Yao. How to generate and exchange secrets. In Proc. of 27th FOCS, pp. 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39200-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:24:29Z","timestamp":1737354269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39200-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540140399","9783540392002"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-39200-9_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}