{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:53Z","timestamp":1764132413974,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438618"},{"type":"electronic","value":"9783540454502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45450-0_37","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:53:10Z","timestamp":1179607990000},"page":"497-511","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries"],"prefix":"10.1007","author":[{"given":"M. V. N. Ashwin","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pages 75\u2013122, 1991.","DOI":"10.1007\/BF00196771"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Donald Beaver, Joan Feigenbaum, Joe Kilian, and Phillip Rogaway. Security with low communication overhead. In CRYPTO\u2019 90, pages 62\u201376, 1990.","DOI":"10.1007\/3-540-38424-3_5"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols. In Proceedings of 22nd ACM STOC, pages 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In Proceedings of 25th ACM STOC, pages 52\u201361, 1993.","DOI":"10.1145\/167088.167109"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of 20th ACM STOC, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In Proceedings of 13th ACM PODC, pages 183\u2013192, 1994.","DOI":"10.1145\/197917.198088"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti and T. Rabin. Optimal asynchronous byzantine agreement. In Proceedings of 25th ACM STOC, pages 42\u201351, 1993.","DOI":"10.1145\/167088.167105"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of 20th ACM STOC, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"37_CR10","series-title":"Lect Notes Comput Sci","volume-title":"EUROCRYPT2000","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In EUROCRYPT2000, LNCS, Springer-Verlag, 2000."},{"key":"37_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"EUROCRYPT\u2019 99","author":"R. Cramer","year":"1999","unstructured":"Ronald Cramer, Ivan Damgard, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT\u2019 99, volume 1592 of LNCS, pages 311\u2013326, 1999."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Matthew K. Franklin and Moti Yung. Communication complexity of secure computation. In Proceedings of 24th ACM STOC, pages 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Micheal O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of 17th ACM PODC, 1998.","DOI":"10.1145\/277697.277716"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th ACM STOC, pages 218\u2013229. ACM Press, 1987.","DOI":"10.1145\/28395.28420"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation. In 16th ACM PODC, pages 25\u201334, August 1997.","DOI":"10.1145\/259380.259412"},{"issue":"1","key":"37_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31\u201360, April 2000.","journal-title":"Journal of Cryptology"},{"key":"37_CR17","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u2019 01","author":"M. Hirt","year":"2001","unstructured":"Martin Hirt and Ueli Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO\u2019 01, LNCS. Springer-Verlag, 2001."},{"key":"37_CR18","series-title":"Lect Notes Comput Sci","volume-title":"ASIA CRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient multi-party computation. In ASIA CRYPT 2000, LNCS. Springer-Verlag, December 2000."},{"key":"37_CR19","unstructured":"M. V. N. Ashwin Kumar, K. Srinathan, and C. Pandu Rangan Asynchronous Perfectly Secure Computation tolerating Generalized Adversaries Technical Report, IITM, Chennai, February 2002."},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In Proceedings of the 8th Annual IEEE Structure in Complexity Theory, pages 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"37_CR21","series-title":"Lect Notes Comput Sci","first-page":"392","volume-title":"CRYPTO\u201991","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway. Secure computation. In CRYPTO\u201991, volume 576 of LNCS, pages 392\u2013404. Springer-Verlag, 1991."},{"key":"37_CR22","series-title":"Lect Notes Comput Sci","first-page":"392","volume-title":"CRYPTO\u2019 91","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway. Secure Computation: The information theoretic case., 1998. Former version: Secure Computation, In CRYPTO\u2019 91, volume 576 of LNCS, pages 392\u2013404, Springer-Verlag, 1991."},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM STOC, pages 73\u201385, 1989.","DOI":"10.1145\/73007.73014"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45450-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T13:32:08Z","timestamp":1737034328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45450-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438618","9783540454502"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45450-0_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}