Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Bit optimal distributed consensus
Computer science
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Unconditionally Secure Digital Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Round Efficient Unconditionally Secure Multiparty Computation Protocol
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Robust multiparty computation with linear communication complexity
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
All known protocols for Byzantine agreement (BA) among n players require the message to be communicated at least Ω(n2) times, which results in an overall communication complexity of at least Ω(ln2) bits for an l-bit message. We present the first BA protocol in which the message is communicated only O(n) times (the hidden factor is less than 2). More concretely, for a given synchronous broadcast protocol which communicates B(b) bits for reaching agreement on a b-bit message with security parameter κ, our construction yields a synchronous BA protocol with communication complexity O(ln+nB(n+κ)) bits. Our reduction is information theoretically secure and tolerates up to tn/2 corrupted players, which is optimal for the consensus variant of BA. Although this resilience is not optimal for the broadcast (Byzantine generals) variant, it is sufficient for most distributed applications that involve BA protocols since they typically require tn/2.