{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:18:35Z","timestamp":1769314715277,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45608-8_24","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:46:39Z","timestamp":1415943999000},"page":"448-465","source":"Crossref","is-referenced-by-count":18,"title":["Multi-valued Byzantine Broadcast: The t\u2009<\u2009n Case"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hirt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Raykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G. Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 483\u2013501. Springer, Heidelberg (2012)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313\u2013322. Plenum Publishing Corporation, New York (1992); Preliminary version appeared in STOC 1989","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 305\u2013328. Springer, Heidelberg (2006)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Coan, B.A., Welch, J.L.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Information and Computation\u00a097, 61\u201385 (1992); Preliminary version appeared in PODC 1989","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing\u00a012(4), 656\u2013666 (1983); Preliminary version appeared in STOC 1982","DOI":"10.1137\/0212045"},{"key":"24_CR7","first-page":"163","volume-title":"Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, PODC 2006","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued Byzantine agreement. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 163\u2013168. ACM, New York (2006)"},{"key":"24_CR8","unstructured":"Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. PhD thesis, ETH Zurich (March 2003), Reprint as vol.\u00a04 of ETH Series in Information Security and Cryptography. Hartung-Gorre Verlag, Konstanz (2003) ISBN 3-89649-853-3"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Simon, J. (ed.) STOC, pp. 148\u2013161. ACM (1988)","DOI":"10.1145\/62212.62225"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S. Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 74\u201394. Springer, Heidelberg (2014)"},{"key":"24_CR11","first-page":"658","volume-title":"Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007","author":"J.A. Garay","year":"2007","unstructured":"Garay, J.A., Katz, J., Koo, C.-Y., Ostrovsky, R.: Round complexity of authenticated broadcast with a dishonest majority. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 658\u2013668. IEEE Computer Society, Washington, DC (2007)"},{"key":"24_CR12","first-page":"218","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1145\/73007.73052","volume-title":"Proceedings of the twenty-first Annual ACM Symposium on Theory of Computing, STOC 1989","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Yao, A.C.: On the improbability of reaching byzantine agreements. In: Proceedings of the twenty-first Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 467\u2013478. ACM, New York (1989)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-54242-8_18","volume-title":"Theory of Cryptography","author":"M. Hirt","year":"2014","unstructured":"Hirt, M., Maurer, U., Raykov, P.: Broadcast amplification. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 419\u2013439. Springer, Heidelberg (2014)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Liang, G., Vaidya, N.: Complexity of multi-value byzantine agreement. Technical report, University of Illinois at Urbana-Champaign (2010), \n                    \n                      http:\/\/www.crhc.illinois.edu\/wireless\/papers\/ba_sum_capacity_0729.pdf","DOI":"10.21236\/ADA555114"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Liang, G., Vaidya, N.: Short note on complexity of multi-value byzantine agreement. CoRR, abs\/1007.4857 (2010)","DOI":"10.21236\/ADA555077"},{"key":"24_CR18","unstructured":"Liang, G., Vaidya, N.: Error-free multi-valued consensus with Byzantine failures. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, pp. 11\u201320. ACM, New York (2011), The arxiv version is available at \n                    \n                      http:\/\/arxiv.org\/abs\/1101.3520"},{"key":"24_CR19","unstructured":"Liang, G., Vaidya, N.: Personal Communication (2014)"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-25873-2_4","volume-title":"Principles of Distributed Systems","author":"A. Patra","year":"2011","unstructured":"Patra, A.: Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 34\u201349. Springer, Heidelberg (2011)"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"24_CR22","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for t \u2265 n\/3. Technical report, IBM Research (1996)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing human ignorance. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 211\u2013228. Springer, Heidelberg (2006)"},{"issue":"2","key":"24_CR24","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"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/800135.804414","volume-title":"Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979","author":"A.C. Yao","year":"1979","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing (preliminary report). In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 209\u2013213. ACM, New York (1979)"},{"key":"24_CR26","first-page":"160","volume-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T12:09:54Z","timestamp":1559045394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}