Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An O(log n) expected rounds randomized byzantine generals protocol
Journal of the ACM (JACM)
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Fast quantum byzantine agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Resilient-optimal interactive consistency in constant time
Distributed Computing
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
Byzantine Consensus with Unknown Participants
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
Noninteractive self-certification for long-lived mobile ad hoc networks
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Proceedings of the 5th European conference on Computer systems
Energy-efficient and non-interactive self-certification in MANETs
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
Simple and efficient perfectly-secure asynchronous MPC
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: a leader-free byzantine consensus algorithm
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)
Brief announcement: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable byzantine computation
ACM SIGACT News
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Information-Theoretically Secure Protocols and Security under Composition
SIAM Journal on Computing
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Leakage-resilient coin tossing
DISC'11 Proceedings of the 25th international conference on Distributed computing
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Optimistic asynchronous atomic broadcast
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Optimal resilience asynchronous approximate agreement
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Brief announcement: efficient optimally resilient statistical AVSS and its applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the (limited) power of non-equivocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the price of equivocation in byzantine agreement
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
When 3f + 1 Is not enough: tradeoffs for decentralized asynchronous Byzantine consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
An equational approach to secure multi-party computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Asynchronous computational VSS with reduced communication complexity
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Cooperative security in distributed networks
Computer Communications
| Hi-index | 0.00 |
A consensus protocol enables a system of n asynchronous processes, some of them malicious, to reach agreement. No assumptions are made on the behaviour of the processes and the message system; both are capable of colluding to prevent the correct processes from reaching decision. A protocol is t-resilient if in the presence of up to t malicious processes it reaches agreement with probability 1. In a recent paper, t-resilient consensus protocols were presented for tn/5. We improve this to tn/3, thus matching the lower bound on the number of correct processes necessary for consensus. The protocol restricts the behaviour of the malicious processes to that of merely fail-stop processes, which makes it interesting in other contexts.