Easy impossibility proofs for distributed consensus problems
Distributed Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Unconditional Byzantine agreement with good majority
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Bit optimal distributed consensus
Computer science
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Communications of the ACM
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On the complexity of broadcast setup
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
Byzantine Agreement (BA) among n players allows the players to agree on a value, even when up to t of the players are faulty. In the broadcast variant of BA, one dedicated player holds a message, and all players shall learn this message. In the consensus variant of BA, every player holds (presumably the same) message, and the players shall agree on this message. BA is the probably most important primitive in distributed protocols, hence its efficiency is of particular importance. BA from scratch, i.e., without a trusted setup, is possible only for t n/3. In this setting, the known BA protocols are highly efficient (O(n2) bits of communication) and provide information-theoretic security. When a trusted setup is available, then BA is possible for t n/2 (consensus), respectively for t n (broadcast). In this setting, only computationally secure BA protocols are reasonably efficient (O(n3κ) bits). When information-theoretic security is required, the most efficient known BA protocols require O(n17κ) bits of communication per BA, where κ denotes a security parameter. The main reason for this huge communication is that in the information-theoretic world, parts of the setup are consumed with every invocation to BA, and hence the setup must be refreshed. This refresh operation is highly complex and communication-intensive. In this paper we present BA protocols (both broadcast and consensus) with information-theoretic security for t n/2, communicating O(n5κ) bits per BA.