{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:35:56Z","timestamp":1765960556668},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424567"},{"type":"electronic","value":"9783540446477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_6","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"101-118","source":"Crossref","is-referenced-by-count":45,"title":["Robustness for Free in Unconditional Multi-party Computation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hirt","sequence":"first","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"6_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. 8th ACM Symposium on Principles of Distributed Computing (PODC), pp. 201\u2013210, Aug. 1989.","DOI":"10.1145\/72981.72995"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation. In Proc. 25th ACM Symposium on the Theory of Computing (STOC), pp. 52\u201361, 1993.","DOI":"10.1145\/167088.167109"},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology\u2014 CRYPTO\u2019 91","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology\u2014 CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science, pp. 420\u2013432, 1991."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pp. 75\u2013122, 1991.","DOI":"10.1007\/BF00196771"},{"key":"6_CR5","unstructured":"E. R. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent Number 4,633,470, 1986."},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 90","author":"D. Beaver","year":"1990","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology \u2014 CRYPTO\u2019 90, volume 537 of Lecture Notes in Computer Science. Springer-Verlag, 1990."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pp. 410\u2013415, 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"6_CR9","series-title":"PhD thesis","volume-title":"Studies in Secure Multiparty Computation and Applications","author":"R. Canetti","year":"1995","unstructured":"R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology \u2014 EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pp. 311\u2013326, 1999."},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 01","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology \u2014 EUROCRYPT\u2019 01, volume 2045 of Lecture Notes in Computer Science, pp. 280\u2013300, 2001."},{"key":"6_CR13","unstructured":"I. Damg\u00e5rd and J. B. Nielsen. An efficient pseudo-random generator with applications to public-key encryption and constant-round multiparty computation. Manuscript, May 2001."},{"key":"6_CR14","unstructured":"Serge Fehr. Personal communications, 2000."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. 26th ACM Symposium on the Theory of Computing (STOC), pp. 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"M. K. Franklin and M. Yung. Communication complexity of secure computation. In Proc. 24th ACM Symposium on the Theory of Computing (STOC), pp. 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game \u2014 a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on the Theory of Computing (STOC), pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"6_CR19","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. 17th ACM Symposium on Principles of Distributed Computing (PODC), pp. 101\u2013111, 1998.","DOI":"10.1145\/277697.277716"},{"key":"6_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology \u2014 ASI-ACRYPT\u2019 00","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, editor, Advances in Cryptology \u2014 ASI-ACRYPT\u2019 00, volume 1976 of Lecture Notes in Computer Science, pp. 143\u2013161. Springer-Verlag, Dec. 2000."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st IEEE Symposium on the Foundations of Computer Science (FOCS), Oct. 2000.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22:612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"6_CR24","series-title":"Lect Notes Comput Sci","volume-title":"Indocrypt 2000","author":"K. Srinathan","year":"2000","unstructured":"K. Srinathan and C. P. Rangan. Efficient asynchronous secure multiparty distributed computation. In Indocrypt 2000, volume 1977 of Lecture Notes in Computer Science, Dec. 2000."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 160\u2013164. IEEE, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:21:57Z","timestamp":1556965317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}