{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:10:16Z","timestamp":1736993416042,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001713"},{"type":"electronic","value":"9783540361787"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_14","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"224-242","source":"Crossref","is-referenced-by-count":5,"title":["Asynchronous Secure Communication Tolerating Mixed Adversaries"],"prefix":"10.1007","author":[{"given":"K.","family":"Srinathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. V. N. Ashwin","family":"Kumar","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,11,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"A. Beimel and Y. Ishai. On the power of nonlinear secret sharing. In 16th Annual IEEE Structure in Complexity Theory, pages 188\u2013202, 2001.","DOI":"10.1109\/CCC.2001.933886"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In 25th ACM STOC, pages 52\u201361, 1993.","DOI":"10.1145\/167088.167109"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In 13th ACM PODC, pages 183\u2013192, 1994.","DOI":"10.1145\/197917.198088"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(97)89208-6","volume":"77","author":"C. Blundo","year":"1997","unstructured":"C. Blundo and D. R. Stinson. Anonymous secret sharing schemes. Discrete Applied Mathematics, 77:13\u201328, 1997.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, volume 40, number 1, pages 17\u201347, 1993.","journal-title":"JACM"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. JACM, volume 32, number 2, pages 374\u2013382, 1985.","journal-title":"JACM"},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","volume-title":"ASIACRYPT\u201999","author":"M. Fitzi","year":"1999","unstructured":"M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multiparty computation. In ASIACRYPT\u201999, volume 1716 of LNCS. Springer-Verlag, 1999."},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9\u201330, 2000.","journal-title":"Journal of Cryptology"},{"issue":"1","key":"14_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"1997","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. Preliminary version appeared in 16th ACM PODC, pages 25-34, August 1997.","journal-title":"Journal of Cryptology"},{"key":"14_CR10","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In IEEE Globecom 87, pages 99\u2013102. IEEE, 1987."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In 8th IEEE Structure in Complexity Theory, pages 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"14_CR12","unstructured":"M.V.N. Ashwin Kumar, P.R. Goundan, K. Srinathan, and C.P. Rangan. On perfectly secure communication over arbitrary networks. In 21st ACM PODC, 2002."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"H. Sayeed and H. Abu-Amara. Perfectly secure message transmission in asynchronous networks. In 7th IEEE Symposium on Parallel and Distributed Processing, 1995.","DOI":"10.1109\/SPDP.1995.530671"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T01:07:57Z","timestamp":1736989677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36178-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36178-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}