STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Unconditional Byzantine agreement with good majority
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Continuum of Failure Models for Distributed Computing
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Byzantine Agreement Secure Against General Adversaries
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Unconditional Byzantine Agreement for any Number of Faulty Processors
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
General Adversaries in Unconditional Multi-party Computation
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards optimal distributed consensus
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Authenticated broadcast with a partially compromised public-key infrastructure
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Secure computation without authentication
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On combining privacy with guaranteed output delivery in secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Authenticated broadcast with a partially compromised public-key infrastructure
Information and Computation
| Hi-index | 0.00 |
Most of the existing feasibility results on Byzantine Agreement (BA) are of an all-or-nothing fashion: in Broadcast they address the question whether or not there exists a protocol which allows any player to broadcast his input. Similarly, in Consensus the question is whether or not consensus can be reached which respects pre-agreement on the inputs of all correct players. In this work, we introduce the natural notion of player-centric BA which is a class of BA primitives, denoted as PCBA = {PCBA(C)}C⊆P, parametrized by subsets C of the player set. For each primitive PCBA(C) ∈ PCBA the validity is defined on the input(s) of the players in C. Broadcast (with sender p) and Consensus are special (extreme) cases of PCBA primitives for C = {p} and C = P, respectively. We study feasibility of PCBA in the presence of a general (aka non-threshold) mixed (active/passive) adversary, and give a complete characterization for perfect, statistical, and computational security. Our results expose an asymmetry of Broadcast which has, so far, been neglected in the literature: there exist non-trivial adversaries which can be tolerated for Broadcast with sender some pi ∈ P but not for some other pj ∈ P being the sender. Finally, we extend the definition of PCBA by adding fail corruption to the adversary's capabilities, and give exact feasibility bounds for computationally secure PCBA(P) (aka Consensus) in this setting. This answers an open problem from ASIACRYPT 2008 concerning feasibility of computationally secure multi-party computation in this model.