On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
How to share a secret with cheaters
Proceedings on Advances in cryptology---CRYPTO '86
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Secret sharing over infinite domains (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Global, unpredictable bit generation without broadcast
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A Probabilistically Correct Leader Election Protocol for Large Groups
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Randomized Shared Queues Applied to Distributed Optimization Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Achievable cases in an asynchronous environment
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Secret Sharing and Non-Shannon Information Inequalities
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Practical impact of group communication theory
Future directions in distributed computing
Uncertainty and predictability: can they be reconciled?
Future directions in distributed computing
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
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
Algorithms and theory of computation handbook
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
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
On composability of reliable unicast and broadcast
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Authenticated Byzantine generals in dual failure model
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
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Our data, ourselves: privacy via distributed noise generation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
State machine replication with byzantine faults
Replication
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Towards a computing model for open distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Scalable byzantine agreement with a random beacon
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine agreement in polynomial expected time: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present a randomized solution for the Byzantine Generals Problems. The solution works in the synchronous as well as the asynchronous case and produces Byzantine Agreement within a fixed small expected number of computational rounds, independent of the number n of processes and the bound t on the number of faulty processes. The solution uses A. Shamir's method for sharing secrets. It specializes to produce a simple solution for the Distributed Commit problem.