Easy impossibility proofs for distributed consensus problems
Distributed Computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Byzantine agreement using partial authentication
DISC'11 Proceedings of the 25th international conference on Distributed computing
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We consider here the Byzantine Agreement problem (BA) in synchronous systems with homonyms in the case where some identifiers may be forgeable. More precisely, the n processes share a set of l (1≤l≤n) identifiers. Assuming that at most t processes may be Byzantine and at most k (t≤k≤l) of these identifiers are forgeable in the sense that any Byzantine process can falsely use them, we prove that Byzantine Agreement problem is solvable if and only if l2t+k. Moreover we extend this result to systems with authentication by signatures in which at most k signatures are forgeable and we prove that Byzantine Agreement problem is solvable if and only if lt+k.