STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Flipping persuasively in constant time
SIAM Journal on Computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the (non)Universality of the One-Time Pad
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the (Im)possibility of Cryptography with Imperfect Randomness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Simple and Efficient Randomized Byzantine Agreement Algorithm
IEEE Transactions on Software Engineering
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Generating Quasi-Random Sequences From Slightly-Random Sources
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Leakage-resilient coin tossing
DISC'11 Proceedings of the 25th international conference on Distributed computing
New independent source extractors with exponential improvement
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solutions to these tasks assume access to a source of unbiased, independent coins. Physical sources of randomness, on the other hand, are rarely unbiased and independent although they do seem to exhibit somewhat imperfect randomness. This gap in modeling questions the relevance of current randomized solutions to computational tasks. Indeed, there has been substantial investigation of this issue in complexity theory in the context of the applications to efficient algorithms and cryptography. In this paper, we seek to determine whether imperfect randomness, modeled appropriately, is “good enough” for distributed algorithms. Namely can we do with imperfect randomness all that we can do with perfect randomness, and with comparable efficiency ? We answer this question in the affirmative, for the problem of Byzantine agreement. We construct protocols for Byzantine agreement in a variety of scenarios (synchronous or asynchronous networks, with or without private channels), in which the players have imperfect randomness. Our solutions are essentially as efficient as the best known randomized agreement protocols, despite the defects in the randomness.