Fault tolerance in networks of bounded degree
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight security proofs for the bounded-storage model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information Theoretically Secure Communication in the Limited Storage Space Model
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Unconditional Security Against Memory-Bounded Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
An evaluative study on the effect of contention on message latencies in large supercomputers
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the use of financial data as a random beacon
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
IEEE Security and Privacy
Pervasive random beacon in the internet for covert coordination
IH'05 Proceedings of the 7th international conference on Information Hiding
| Hi-index | 0.00 |
We present two Monte Carlo algorithms for efficiently computing Byzantine agreement in the partially synchronous communication model. The algorithms assume the existence of a Random Beacon, which is a stream of random bits, known to all the processors. Both algorithms terminate in O(1) expected time. The first algorithm sends O(M+nlog2n) messages in total, where M is the maximum number of messages sent by the bad processors in any round and n is the number of processors. It ensures all processors reach agreement. The second algorithm sends $\tilde{O}(1)$ messages per processor, and is thus load-balanced, and ensures all but a o(1) fraction of the processors reach agreement. Both algorithms succeed with probability 1−O(1/nk), even against an adaptive adversary that takes over up to a 1/3−ε fraction of the processors for any ε0. We prove the correctness of both algorithms and provide empirical evidence that they require significantly less bandwidth than previous algorithms for networks of size greater than 4,000 processors. Our algorithms work in the full-information model and thus make no cryptographic assumptions.