{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:46:34Z","timestamp":1777376794374,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_28","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"463-482","source":"Crossref","is-referenced-by-count":45,"title":["Robust Multiparty Computation with Linear Communication Complexity"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hirt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC 1989 (1989)","DOI":"10.1145\/72981.72995"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver, D.: Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology\u00a04(2), 75\u2013122 (1991)","journal-title":"Journal of Cryptology"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-38424-3_5","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D. Beaver","year":"1991","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead (extended abstract). In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 62\u201376. Springer, Heidelberg (1991)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 305\u2013328. Springer, Heidelberg (2006)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd STOC (1990)","DOI":"10.1145\/100216.100287"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th STOC (1988)","DOI":"10.1145\/62212.62214"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 311. Springer, Heidelberg (1999)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S.: On the complexity of verifiable secret sharing and multiparty computation. In: 32nd STOC (2000)","DOI":"10.1145\/335305.335343"},{"key":"28_CR12","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":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 316. Springer, Heidelberg (2000)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 280. Springer, Heidelberg (2001)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 418. Springer, Heidelberg (2000)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued byzantine agreement. In: 25th PODC (2006)","DOI":"10.1145\/1146381.1146407"},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"Franklin, M., Haber, S.: Joint encryption and message-efficient secure computation. Journal of Cryptology\u00a09(4), 217\u2013232 (1996)","journal-title":"Journal of Cryptology"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 19th STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In: PODC 1998 (1998)","DOI":"10.1145\/277697.277716"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol probleman efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 143. Springer, Heidelberg (2000)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Hirt","year":"2001","unstructured":"Hirt, M., Maurer, U.M.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 101. Springer, Heidelberg (2001)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11426639_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience (Extended abstract). In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 322\u2013340. Springer, Heidelberg (2005)"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11593447_5","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M. Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B.: Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 79\u201399. Springer, Heidelberg (2005)"},{"key":"28_CR26","unstructured":"Nielsen, J.B.: On Protocol Security in the Cryptographic Model. PhD Thesis. Department of Computer Science, University of Aarhus (2003)"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Rabin","year":"1998","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 89. Springer, Heidelberg (1998)"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21th STOC (1989)","DOI":"10.1145\/73007.73014"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd FOCS (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:11Z","timestamp":1605644171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11818175_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}