{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:39:22Z","timestamp":1725561562995},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642147111"},{"type":"electronic","value":"9783642147128"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14712-8_10","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T05:17:50Z","timestamp":1280380670000},"page":"162-177","source":"Crossref","is-referenced-by-count":8,"title":["Communication Optimal Multi-valued Asynchronous Broadcast Protocol"],"prefix":"10.1007","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"27","volume-title":"PODC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In: PODC, pp. 27\u201330. ACM Press, New York (1983)"},{"key":"10_CR2","first-page":"52","volume-title":"STOC","author":"M. Ben-Or","year":"1993","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. In: STOC, pp. 52\u201361. ACM Press, New York (1993)"},{"key":"10_CR3","first-page":"1","volume-title":"STOC","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In: STOC, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"10_CR4","first-page":"183","volume-title":"PODC","author":"M. BenOr","year":"1994","unstructured":"BenOr, M., Kelmer, B., Rabin, T.: Asynchronous Secure Computations with Optimal Resilience. In: PODC, pp. 183\u2013192. ACM Press, New York (1994)"},{"key":"10_CR5","first-page":"154","volume-title":"PODC","author":"G. Bracha","year":"1984","unstructured":"Bracha, G.: An Asynchronous $\\lfloor (n - 1) \/ 3 \\rfloor$ -resilient Consensus Protocol. In: PODC, pp. 154\u2013162. ACM Press, New York (1984)"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous Consensus and Broadcast Protocols. J. ACM\u00a032(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"10_CR7","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"key":"10_CR8","first-page":"11","volume-title":"STOC","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Crpeau, C., Damg\u00e5rd, I.: Multiparty Unconditionally Secure Protocols (Extended Abstract). In: STOC, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"10_CR9","first-page":"383","volume-title":"STOC","author":"B. Chor","year":"1985","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In: STOC, pp. 383\u2013395. ACM Press, New York (1985)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. JACM\u00a040(1), 17\u201347 (1993)","journal-title":"JACM"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). In: FCT, pp. 127\u2013140 (1983)","DOI":"10.1007\/3-540-12689-9_99"},{"key":"10_CR13","unstructured":"Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. PhD thesis, ETH Zurich (2002)"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/1146381.1146407","volume-title":"PODC","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Hirt, M.: Optimally Efficient Multi-valued Byzantine Agreement. In: PODC, pp. 163\u2013168. ACM Press, New York (2006)"},{"key":"10_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"10_CR16","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R.E., Lamport, L.: Reaching Agreement in the Presence of Faults. JACM\u00a027(2), 228\u2013234 (1980)","journal-title":"JACM"},{"key":"10_CR18","first-page":"403","volume-title":"FOCS","author":"M.O. Rabin","year":"1983","unstructured":"Rabin, M.O.: Randomized Byzantine Generals. In: FOCS, pp. 403\u2013409. IEEE Computer Society Press, Los Alamitos (1983)"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement. Information Processing Letters\u00a018(2), 73\u201376 (1984)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14712-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T08:55:28Z","timestamp":1685696128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14712-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642147111","9783642147128"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14712-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}