A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary
Siddhant Goenka, Sisi Duan, Haibin Zhang · 2018
We describe efficient path-based Byzantine routing protocols that are secure against fully Byzantine adversaries. Our work is in sharp contrast to prior works which handle a weaker subset of Byzantine attacks. We provide a formal proof of correctness of our protocols which, to our knowledge, is the first of its kind. We implement and evaluate our protocols using DeterLab, demonstrating that our protocols are as efficient as those secure against weaker adversaries and our protocols can efficiently and correctly detect routers that fail arbitrarily.