Abstract
Byzantine broadcast is a distributed primitive that allows a specific party to consistently distribute a message among n parties in the presence of potential misbehavior of up to t of the parties. All known protocols implementing broadcast of an ℓ-bit message from point-to-point channels tolerating any t < n Byzantine corruptions have communication complexity at least Ω(ℓn 2). In this paper we give cryptographically secure and information-theoretically secure protocols for t < n that communicate \(\mathcal{O}(\ell n)\) bits when ℓ is sufficiently large. This matches the optimal communication complexity bound for any protocol allowing to broadcast ℓ-bit messages. While broadcast protocols with the optimal communication complexity exist for t < n/2, this paper is the first to present such protocols for t < n.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Asharov, G., Jain, A., López-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. 7237, pp. 483–501. Springer, Heidelberg (2012)
Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313–322. Plenum Publishing Corporation, New York (1992); Preliminary version appeared in STOC 1989
Beerliová-Trubíniová, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305–328. Springer, Heidelberg (2006)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Coan, B.A., Welch, J.L.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Information and Computation 97, 61–85 (1992); Preliminary version appeared in PODC 1989
Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing 12(4), 656–666 (1983); Preliminary version appeared in STOC 1982
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–168. ACM, New York (2006)
Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. PhD thesis, ETH Zurich (March 2003), Reprint as vol. 4 of ETH Series in Information Security and Cryptography. Hartung-Gorre Verlag, Konstanz (2003) ISBN 3-89649-853-3
Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Simon, J. (ed.) STOC, pp. 148–161. ACM (1988)
Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74–94. Springer, Heidelberg (2014)
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–668. IEEE Computer Society, Washington, DC (2007)
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–229. ACM, New York (1987)
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–478. ACM, New York (1989)
Hirt, M., Maurer, U., Raykov, P.: Broadcast amplification. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 419–439. Springer, Heidelberg (2014)
Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445–462. Springer, Heidelberg (2006)
Liang, G., Vaidya, N.: Complexity of multi-value byzantine agreement. Technical report, University of Illinois at Urbana-Champaign (2010), http://www.crhc.illinois.edu/wireless/papers/ba_sum_capacity_0729.pdf
Liang, G., Vaidya, N.: Short note on complexity of multi-value byzantine agreement. CoRR, abs/1007.4857 (2010)
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–20. ACM, New York (2011), The arxiv version is available at http://arxiv.org/abs/1101.3520
Liang, G., Vaidya, N.: Personal Communication (2014)
Patra, A.: Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 34–49. Springer, Heidelberg (2011)
Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)
Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Technical report, IBM Research (1996)
Rogaway, P.: Formalizing human ignorance. In: Nguyên, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 211–228. Springer, Heidelberg (2006)
Turpin, R., Coan, B.A.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters 18(2), 73–76 (1984)
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–213. ACM, New York (1979)
Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 160–164. IEEE Computer Society, Washington, DC (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 International Association for Cryptologic Research
About this paper
Cite this paper
Hirt, M., Raykov, P. (2014). Multi-valued Byzantine Broadcast: The t < n Case. In: Sarkar, P., Iwata, T. (eds) Advances in Cryptology – ASIACRYPT 2014. ASIACRYPT 2014. Lecture Notes in Computer Science, vol 8874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45608-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-662-45608-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45607-1
Online ISBN: 978-3-662-45608-8
eBook Packages: Computer ScienceComputer Science (R0)