{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:53Z","timestamp":1742912453077,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_15","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"163-180","source":"Crossref","is-referenced-by-count":12,"title":["Graceful Degradation in Multi-Party Computation (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hirt","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Lucas","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Raub","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/0-387-34805-0_49","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Beaver","year":"1990","unstructured":"Beaver, D.: Multiparty protocols tolerating half faulty processors. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 560\u2013572. Springer, Heidelberg (1990)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-78524-8_14","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Fitzi, M., Hirt, M., Maurer, U.M., Zikas, V.: MPC vs. SFE: Perfect security in a unified corruption model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 231\u2013250. Springer, Heidelberg (2008)"},{"key":"15_CR3","first-page":"1","volume-title":"STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1\u201310. ACM, New York (1988)"},{"key":"15_CR4","first-page":"11","volume-title":"STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC 1988, pp. 11\u201319. ACM, New York (1988)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Damg\u00e5rd, I.B., van de Graaf, J.: Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 87\u2013119. Springer, Heidelberg (1988)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/0-387-34805-0_52","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D.: The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptograhically from majorities. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 591\u2013602. Springer, Heidelberg (1990)"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM\u00a040(1), 17\u201347 (1993)","journal-title":"Journal of the ACM"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-39200-9_4","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Fitzi","year":"2003","unstructured":"Fitzi, M., Hirt, M., Holenstein, T., Wullschleger, J.: Two-threshold broadcast and detectable multi-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 51\u201367. Springer, Heidelberg (2003)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0055724","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Hirt, M., Maurer, U.M.: Trading correctness for privacy in unconditional multi-party computation (extended abstract). In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 121\u2013136. Springer, Heidelberg (1998)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-48000-6_19","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Fitzi","year":"1999","unstructured":"Fitzi, M., Hirt, M., Maurer, U.M.: General adversaries in unconditional multi-party computation. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 232\u2013246. Springer, Heidelberg (1999)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-24676-3_25","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Fitzi","year":"2004","unstructured":"Fitzi, M., Holenstein, T., Wullschleger, J.: Multi-party computation with hybrid security. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 419\u2013438. Springer, Heidelberg (2004)"},{"key":"15_CR12","first-page":"218","volume-title":"STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"15_CR13","first-page":"101","volume-title":"PODC 1998","author":"R. Gennaro","year":"1998","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: PODC 1998, pp. 101\u2013111. ACM, New York (1998)"},{"key":"15_CR14","first-page":"25","volume-title":"PODC 1997","author":"M. Hirt","year":"1997","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: PODC 1997, pp. 25\u201334. ACM, New York (1997)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89255-7_1","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M. Hirt","year":"2008","unstructured":"Hirt, M., Maurer, U.M., Zikas, V.: MPC vs. SFE: Unconditional and computational security. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 1\u201318. Springer, Heidelberg (2008)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11818175_29","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y. Ishai","year":"2006","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: On combining privacy with guaranteed output delivery in secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 483\u2013500. Springer, Heidelberg (2006)"},{"key":"15_CR17","first-page":"11","volume-title":"STOC 2007","author":"J. Katz","year":"2007","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: STOC 2007, pp. 11\u201320. ACM, New York (2007)"},{"key":"15_CR18","first-page":"316","volume-title":"STOC 2000","author":"J. Kilian","year":"2000","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC 2000, pp. 316\u2013324. ACM, New York (2000)"},{"key":"15_CR19","first-page":"219","volume-title":"PODC 2010","author":"C. Lucas","year":"2010","unstructured":"Lucas, C., Raub, D., Maurer, U.: Hybrid-secure MPC: Trading information-theoretic robustness for computational privacy. In: PODC 2010, pp. 219\u2013228. ACM, New York (2010)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-36413-7_2","volume-title":"Security in Communication Networks","author":"U.M. Maurer","year":"2003","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 14\u201328. Springer, Heidelberg (2003)"},{"key":"15_CR21","first-page":"73","volume-title":"STOC 1989","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989, pp. 73\u201385. ACM, New York (1989)"},{"issue":"11","key":"15_CR22","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"15_CR23","first-page":"160","volume-title":"FOCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS 1982, pp. 160\u2013164. IEEE, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T03:21:12Z","timestamp":1558581672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}