TY - GEN
T1 - A formal treatment of efficient byzantine routing against fully byzantine adversary
AU - Goenka, Siddhant
AU - Duan, Sisi
AU - Zhang, Haibin
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/26
Y1 - 2018/11/26
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85059973339&partnerID=8YFLogxK
U2 - 10.1109/NCA.2018.8548163
DO - 10.1109/NCA.2018.8548163
M3 - Conference contribution
AN - SCOPUS:85059973339
T3 - NCA 2018 - 2018 IEEE 17th International Symposium on Network Computing and Applications
BT - NCA 2018 - 2018 IEEE 17th International Symposium on Network Computing and Applications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 17th IEEE International Symposium on Network Computing and Applications, NCA 2018
Y2 - 1 November 2018 through 3 November 2018
ER -