{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:11:01Z","timestamp":1764645061219},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851738"},{"type":"electronic","value":"9783540851745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_14","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T08:32:02Z","timestamp":1219221122000},"page":"241-261","source":"Crossref","is-referenced-by-count":74,"title":["Scalable Multiparty Computation with Nearly Optimal Work and Resilience"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Mikkel","family":"Kr\u00f8igaard","sequence":"additional","affiliation":[]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: Proc. CCC 2005, pp. 260\u2013274 (2005)","DOI":"10.1109\/CCC.2005.9"},{"key":"14_CR2","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. Beerliova-Trubiniova","year":"2006","unstructured":"Beerliova-Trubiniova, 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":"14_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"Z. Beerliova-Trubiniova","year":"2008","unstructured":"Beerliova-Trubiniova, Z., Hirt, M.: Perfectly-Secure MPC with Linear Communication Complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, Springer, Heidelberg (to appear, 2008)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An O(logn) expected rounds randomized byzantine generals protocol. Journal of the ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"Journal of the ACM"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Proc. FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multiparty Computation. In: Proc. STOC 1996, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. STOC 2002, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proc. STOC 1988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"14_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., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"14_CR11","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., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"14_CR12","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. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable Secure Multiparty Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, V. (ed.) CRYPTO 2005, vol.\u00a03621, pp. 378\u2013394. Springer, Heidelberg (2005)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"14_CR15","unstructured":"Damg\u00e5rd, I., Nielsen, J.: Robust multiparty computation with linear communication complexity. In: Proc. Crypto 2007, pp. 572\u2013590 (2007)"},{"key":"14_CR16","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J., Smith, A.: Scalable Multiparty Computation with Nearly Optimal Work and Resilience (full version of this paper)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M., Garay, J., Vardhan, H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally Efficient Multi-Valued Byzantine Agreement. In: Proc. PODC 2006, pp. 163\u2013168 (2006)","DOI":"10.1145\/1146381.1146407"},{"key":"#cr-split#-14_CR19.1","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Haber, S.: Joint Encryption and Message-Efficient Secure Computation. In: Proc. Crypto 1993, pp. 266\u2013277 (1993);","DOI":"10.1007\/3-540-48329-2_23"},{"key":"#cr-split#-14_CR19.2","unstructured":"Full version in Journal of Cyptoglogy 9(4), 217\u2013232 (1996)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication Complexity of Secure Computation. In: Proc. STOC 1992, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proc. 17th PODC, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game (extended abstract). In: Proc. STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-74143-5_16","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Harnik","year":"2007","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E.: How many oblivious transfers are needed for secure multiparty computation? In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 284\u2013302. Springer, Heidelberg (2007)"},{"key":"14_CR24","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, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR26","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, pp. 143\u2013161. Springer, Heidelberg (2000)"},{"key":"14_CR27","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":"14_CR28","series-title":"Lecture Notes in Computer Science","first-page":"572","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Hirt","year":"2007","unstructured":"Hirt, M., Nielsen, J.B.: Robust Multiparty Computation with Linear Communication Complexity. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 572\u2013590. Springer, Heidelberg (2007)"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information theoretically secure protocols and security under composition. In: Proc. STOC 2006, pp. 109\u2013118 (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"14_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/b13246","volume-title":"Composition of Secure Multi-Party Protocols, A Comprehensive Study","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Composition of Secure Multi-Party Protocols, A Comprehensive Study. Springer, Heidelberg (2003)"},{"issue":"3","key":"14_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"6","key":"14_CR33","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. Commun. ACM\u00a022(6), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and Applications of Trapdoor Functions (Extended Abstract). In: Proc. FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. FOCS 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:22:26Z","timestamp":1606166546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}