We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...
Abstract— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a mali...
Sidharth Jaggi, Michael Langberg, Sachin Katti, Tr...
—This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide area sites. The architecture confines ...
Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan ...