A formal treatment of efficient byzantine routing against fully byzantine adversary

Siddhant Goenka, Sisi Duan, Haibin Zhang

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名NCA 2018 - 2018 IEEE 17th International Symposium on Network Computing and Applications
出版商Institute of Electrical and Electronics Engineers Inc.
ISBN(电子版)9781538676592
DOI
出版状态已出版 - 26 11月 2018
已对外发布
活动17th IEEE International Symposium on Network Computing and Applications, NCA 2018 - Cambridge, 美国
期限: 1 11月 20183 11月 2018

出版系列

姓名NCA 2018 - 2018 IEEE 17th International Symposium on Network Computing and Applications

会议

会议17th IEEE International Symposium on Network Computing and Applications, NCA 2018
国家/地区美国
Cambridge
时期1/11/183/11/18

指纹

探究 'A formal treatment of efficient byzantine routing against fully byzantine adversary' 的科研主题。它们共同构成独一无二的指纹。

引用此