针对完全拜占庭对手的有效拜占庭路由的形式化处理

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI:10.1109/NCA.2018.8548163

Siddhant Goenka, Sisi Duan, Haibin Zhang

{"title":"针对完全拜占庭对手的有效拜占庭路由的形式化处理","authors":"Siddhant Goenka, Sisi Duan, Haibin Zhang","doi":"10.1109/NCA.2018.8548163","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary\",\"authors\":\"Siddhant Goenka, Sisi Duan, Haibin Zhang\",\"doi\":\"10.1109/NCA.2018.8548163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":268662,\"journal\":{\"name\":\"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2018.8548163\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2018.8548163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们描述了有效的基于路径的拜占庭路由协议，它对完全拜占庭的对手是安全的。我们的工作与先前处理拜占庭攻击的较弱子集的工作形成鲜明对比。我们提供了我们协议正确性的正式证明，据我们所知，这是同类中的第一个。我们使用detlab实现和评估我们的协议，证明我们的协议与那些针对较弱对手的安全协议一样有效，并且我们的协议可以有效正确地检测任意故障的路由器。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)

自引率

0.00%

发文量