Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Byzantine Agreement Protocol using Hierarchical Groups
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Scaling Byzantine Fault-Tolerant Replication toWide Area Networks
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards Secure and Scalable Computation in Peer-to-Peer Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Contemporary approaches to fault tolerance
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Making Byzantine fault tolerant systems tolerate Byzantine faults
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Designing secure sensor networks
IEEE Wireless Communications
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends only Õ(&sqrt;n) bits, where n is the total number of processors. Our algorithm succeeds with high probability against an adaptive adversary, which can take over processors at any time during the protocol, up to the point of taking over arbitrarily close to a 1/3 fraction. We assume synchronous communication but a rushing adversary. Moreover, our algorithm works in the presence of flooding: processors controlled by the adversary can send out any number of messages. We assume the existence of private channels between all pairs of processors but make no other cryptographic assumptions. Finally, our algorithm has latency that is polylogarithmic in n. To the best of our knowledge, ours is the first algorithm to solve Byzantine agreement against an adaptive adversary, while requiring o(n2) total bits of communication.