{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T07:50:25Z","timestamp":1792482625297,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540658894","type":"print"},{"value":"9783540489108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48910-x_22","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T09:57:35Z","timestamp":1192010255000},"page":"311-326","source":"Crossref","is-referenced-by-count":132,"title":["Efficient Multiparty Computations Secure Against an Adaptive Adversary"],"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":"Stefan","family":"Dziembowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Hirt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,4,15]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75\u2013122, 1991.","journal-title":"Journal of Cryptology"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1\u201310. ACM, 1988.","DOI":"10.1145\/62212.62213"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. Eurocrypt\u2019 92, pp. 307\u2013323. Springer LNCS 658, 1992.","DOI":"10.1007\/3-540-47555-9_26"},{"key":"22_CR4","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. Manuscript, to appear, 1998."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11\u201319. ACM, 1988.","DOI":"10.1145\/62212.62214"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th FOCS, pp. 383\u2013395. IEEE, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. Manuscript, 1999.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In 28th STOC, pp. 639\u2013648. ACM, 1996.","DOI":"10.1145\/237814.238015"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali. An optimal algorithm for synchronous Byzantine agreement. In 20th STOC, pp. 148\u2013161. ACM, 1988.","DOI":"10.1145\/62212.62225"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majorityFair computation of general functions in presence of immoral majority. Crypto\u2019 90, pp. 77\u201393. Springer LNCS 537, 1990.","DOI":"10.1007\/3-540-38424-3_6"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th STOC, pp. 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin, and T Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th PODC, pp. 101\u2013111. ACM, 1998.","DOI":"10.1145\/277697.277716"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in general multiparty computations. In 16th PODC, pp. 25\u201334. ACM, 1998.","DOI":"10.1145\/259380.259412"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In Proc. of Structure in Complexity, pp. 383\u2013395, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"S. Micali and P. Rogaway. Secure computation. Crypto\u2019 91, pp. 392\u2013404. Springer LNCS 576, 1991.","DOI":"10.1007\/3-540-46766-1_32"},{"key":"22_CR16","unstructured":"S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, to appear, 1998."},{"issue":"6","key":"22_CR17","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 faulty. Journal of the ACM, 41(6):1089\u20131109, 1994.","journal-title":"Journal of the ACM"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st STOC, pp. 73\u201385. ACM, 1989.","DOI":"10.1145\/73007.73014"},{"key":"22_CR19","unstructured":"A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q 2 adversary structures. Manuscript, 1998."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"A.C. Yao. Protocols for secure computations. In 23rd FOCS, pp. 160\u2013164. IEEE, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48910-X_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T07:12:01Z","timestamp":1684048321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48910-X_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658894","9783540489108"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48910-x_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}