SIAM Journal on Computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimal time-space tradeoff for shared memory leader election
Journal of Algorithms
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
| Hi-index | 0.00 |
Adding Byzantintolerance to large scale distributed systems is considered non-practical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problemin the presence of a fl-local Byzantinadversary. The local adversary cannot control more than flneighbors of any given node. This paper proves sufficient conditions as to when the synchronous Byzantinconsensus problemcan be solved in the presence of a fl-local adversary.Moreover, we show that for a family of graphs, the Byzantinconsensus problem can be solved using a relatively small number of messages, and with time complexity proportional to the diameter of the network. Specifically, for a family of bounded-degree graphs with logarithmic diameter, O(logn) time and O(nlogn) messages. Furthermore, our proposed solution requires constant memory space at each node.