{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:01:00Z","timestamp":1793102460819,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_22","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:26:08Z","timestamp":1184588768000},"page":"316-334","source":"Crossref","is-referenced-by-count":351,"title":["General Secure Multi-party Computation from any Linear Secret-Sharing Scheme"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Proc. CRYPTO\u2019 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver, Foundations of secure interactive computing, Proc. CRYPTO\u2019 91, Springer Verlag LNCS, vol. 576, pp. 377\u2013391."},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BFb0054140","volume-title":"Proc. EUROCRYPT\u2019 98","author":"D. Beaver","year":"1998","unstructured":"D. Beaver and A. Wool, Quorum-based multi-party computations, Proc. EUROCRYPT\u2019 98, Springer Verlag LNCS, vol. 1403, pp. 375\u2013390."},{"key":"22_CR3","volume-title":"Secure schemes for secret sharing and key distribution","author":"A. Beimel","year":"1996","unstructured":"A. Beimel, Secure schemes for secret sharing and key distribution, Ph.D.-thesis, Technion, Haifa, June 1996."},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","first-page":"25","volume-title":"Proc. CRYPTO\u2019 88","author":"J. Benaloh","year":"1990","unstructured":"J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, Proc. CRYPTO\u2019 88, Springer Verlag LNCS, vol. 403, pp. 25\u201335."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proc. ACM STOC\u2019 88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Proc. AUSCRYPT\u2019 92","author":"M. Bertilsson","year":"1993","unstructured":"M. Bertilsson, I. Ingemarsson, A construction of practical secret sharing schemes using linear block codes, Proc. AUSCRYPT\u2019 92, Springer Verlag LNCS, vol. 718, pp. 67\u201379."},{"key":"22_CR7","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Maths. & Combin. Comp. 9 (1989), pp. 105\u2013113.","journal-title":"J. Combin. Maths. & Combin. Comp."},{"key":"22_CR8","volume-title":"Studies in secure multi-party computation and applications","author":"R. Canetti","year":"1995","unstructured":"R. Canetti, Studies in secure multi-party computation and applications, Ph. D. thesis, Weizmann Institute of Science, Rehovot, 1995."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, Proc. ACM STOC\u2019 96, pp. 639\u2013648.","DOI":"10.1145\/237814.238015"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multi-party unconditionally secure protocols, Proc. ACM STOC\u2019 88, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, Proc. FOCS\u2019 85, pp. 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"22_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Proc. CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, I. Damg\u00e5rd, Zero Knowledge for Finite Field Arithmetic or: Can Zero Knowledge be for Free?, Proc. CRYPTO\u201998, Springer Verlag LNCS, vol. 1462, pp. 424\u2013441."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, On the complexity of verifiable secret sharing and multi-party computation, Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC\u2019 00), Portland, Oregon, May 2000.","DOI":"10.1145\/335305.335343"},{"key":"22_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Proc. 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, Proc. EUROCRYPT\u2019 99, Springer Verlag LNCS, vol. 1592, pp. 311\u2013326."},{"key":"22_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"proc. CRYPTO\u2019 95","author":"C. Cr\u00e9peau","year":"1995","unstructured":"C. Cr\u00e9peau, J. van de Graaf and A. Tapp, Committed oblivious transfer and private multi-party computation, proc. CRYPTO\u2019 95, Springer Verlag LNCS, vol. 963, pp. 110\u2013123."},{"key":"22_CR16","unstructured":"M. van Dijk, Secret key sharing and secret key generation, Ph.D. Thesis, Eindhoven University of Technology, 1997."},{"key":"22_CR17","unstructured":"S. Fehr, Efficient construction of dual MSP, manuscript 1999."},{"key":"22_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Proc. 12th Int. Symp. on Distributed Computing (DISC\u2019 98)","author":"M. Fitzi","year":"1998","unstructured":"M. Fitzi, U. Maurer, Efficient Byzantine agreement secure against general adversaries, Proc. 12th Int. Symp. on Distributed Computing (DISC\u2019 98), Springer Verlag LNCS, vol. 1499, pp. 134\u2013148."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"A. G\u00e1l, A characterization of span program size and improved lower bounds for monotone span programs, Proceedings of the 30th ACM Symposium on the Theory of Computing, 1998, pp. 429\u2013437.","DOI":"10.1145\/276698.276855"},{"key":"22_CR20","unstructured":"A. G\u00e1l, Combinatorial methods in Boolean function complexity, Ph.D.-thesis, University of Chicago, 1995."},{"key":"22_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-48184-2_10","volume-title":"Proc. CRYPTO\u201987","author":"Z. Galil","year":"1988","unstructured":"Z. Galil, S. Haber and M. Yung, Cryptographic computation: Secure fault-tolerant protocols and the public-key model, Proc. CRYPTO\u201987, Springer Verlag LNCS, vol. 293, pp. 135\u2013155."},{"key":"22_CR22","unstructured":"R. Gennaro, Theory and practice of veri_able secret sharing, Ph.D. thesis, MIT, 1996."},{"key":"22_CR23","unstructured":"R. Gennaro, M. Rabin, T. Rabin, Simplified VSS and fast-track multi-party computations with applications to threshold cryptography, Proc. ACM PODC\u201998."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, Proc. ACM STOC\u2019 87, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, Player simulation and general adversary structures in perfect multi-party computation, Journal of Cryptology, vol. 13, no. 1, pp. 31\u201360, 2000. (Preliminary version in Proc. ACM PODC\u201997, pp. 25\u201334.)","journal-title":"Journal of Cryptology"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"M. Ito, A. Saito and T. Nishizeki, Secret sharing schemes realizing general access structures, Proc. IEEE GlobeCom\u2019 87 Tokyo, pp. 99\u2013102.","DOI":"10.1002\/ecjc.4430720906"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"M. Karchmer, A. Wigderson, On span programs, Proc. of Structure in Complexity\u2019 93, pp. 102\u2013111.","DOI":"10.1109\/SCT.1993.336536"},{"key":"22_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Proc. CRYPTO\u2019 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway, Secure computation, Manuscript, Preliminary version in Proc. CRYPTO\u2019 91, Springer Verlag LNCS, vol. 576, pp. 392\u2013404"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or, Verifiable secret sharing and multi-party protocols with honest majority, Proc. ACM STOC\u2019 89, pp. 73\u201385.","DOI":"10.1145\/73007.73014"},{"issue":"6","key":"22_CR30","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin, Robust sharing of secrets when the dealer is honest or cheating, J. ACM, 41(6):1089\u20131109, November 1994.","journal-title":"J. ACM"},{"key":"22_CR31","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 (1979) 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"22_CR32","unstructured":"Technical report, full version of this paper. Will be posted on the Web and is available from the authors. Obsolete are the earlier versions: Span programs and general secure multi-party computation, BRICS Report RS-97-28, Nov. 1997, and Enforcing the multiplication property on MSPs, with only constant overhead, Jan. 1999."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T06:59:41Z","timestamp":1737269981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}