STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Bit optimal distributed consensus
Computer science
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Distributed consensus revisited
Information Processing Letters
Global, unpredictable bit generation without broadcast
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed 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)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms
Optimal Amortized Distributed Consensus (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Asymptotically Optimal Distributed Consensus (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Threshold Pseudorandom Function Construction and Its Applications
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Collective Coin Tossing Without Assumptions nor Broadcasting
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Resilient-optimal interactive consistency in constant time
Distributed Computing
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improving the Round Complexity of VSS in Point-to-Point Networks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Improving the round complexity of VSS in point-to-point networks
Information and Computation
Improved fault tolerance and secure computation on sparse networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Edge fault tolerance on sparse networks
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
In this paper we consider the following two variants of the consensus problem. First, the strong consensus problem, where n players attempt to reach agreement on a value initially held by one of the correct players, despite the (malicious) behavior of up to t of them. (Recall that in the standard version of the problem, the players are also required to decide on one of the correct players' input values, but only when they all start with the same value; otherwise, they can decide on a default.) Although the problem is closely related to the standard problem, the only known solution with the optimal number of players requires exponential computation and communication in the unconditional setting.Even though the decision would be a value originally held by a correct player, strong consensus allows for a decision value that is the least common among the correct players. We also formulate the δ-differential consensus problem, which specifies that the value agreed on must be of a certain plurality among the correct players --- specifically, that the plurality of any other value cannot exceed the plurality of the decision value by more than δ.In this paper we study these problems, and present efficient protocols and tight lower bounds for several standard distributed computation models --- unconditional, computational, synchronous, and asynchronous.