Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Simplifying fault-tolerance: providing the abstraction of crash failures
Journal of the ACM (JACM)
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A flexible formal framework for masking/demasking faults
Information Sciences—Informatics and Computer Science: An International Journal
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
The perfectly synchronized round-based model of distributed computing
Information and Computation
Game authority for robust andscalable distributed selfish-computer systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Secure Time Synchronization in Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Reputation management algorithms for DHT-based peer-to-peer environment
Computer Communications
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
A sybil-proof referral system based on multiplicative reputation chains
IEEE Communications Letters
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Continuous consensus with ambiguous failures
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Continuous consensus with ambiguous failures
Theoretical Computer Science
Secure message transmission by public discussion: a brief survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Secure message transmission with small public discussion
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine vector consensus in complete graphs
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.