{"title":"早期发现大规模攻击的拜占庭式解决方案","authors":"Khaled Barbaria, Belhassen Zouari","doi":"10.1109/CRISIS.2008.4757470","DOIUrl":null,"url":null,"abstract":"The quality and the timeliness of the detection of massive attacks significantly limit their great danger. In this paper, we describe an existing solution based on a centralized treatment of threat reports generated by probes deployed at the edges of a national Cyber-space. We also propose a more reliable architecture based on a consensus algorithm that solves the interactive consistency problem under the Byzantine assumptions. We prove the correctness of our algorithm and show its contribution to the early detection of massive attacks.","PeriodicalId":346123,"journal":{"name":"2008 Third International Conference on Risks and Security of Internet and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Byzantine solution to early detect massive attacks\",\"authors\":\"Khaled Barbaria, Belhassen Zouari\",\"doi\":\"10.1109/CRISIS.2008.4757470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The quality and the timeliness of the detection of massive attacks significantly limit their great danger. In this paper, we describe an existing solution based on a centralized treatment of threat reports generated by probes deployed at the edges of a national Cyber-space. We also propose a more reliable architecture based on a consensus algorithm that solves the interactive consistency problem under the Byzantine assumptions. We prove the correctness of our algorithm and show its contribution to the early detection of massive attacks.\",\"PeriodicalId\":346123,\"journal\":{\"name\":\"2008 Third International Conference on Risks and Security of Internet and Systems\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Third International Conference on Risks and Security of Internet and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CRISIS.2008.4757470\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Third International Conference on Risks and Security of Internet and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRISIS.2008.4757470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Byzantine solution to early detect massive attacks
The quality and the timeliness of the detection of massive attacks significantly limit their great danger. In this paper, we describe an existing solution based on a centralized treatment of threat reports generated by probes deployed at the edges of a national Cyber-space. We also propose a more reliable architecture based on a consensus algorithm that solves the interactive consistency problem under the Byzantine assumptions. We prove the correctness of our algorithm and show its contribution to the early detection of massive attacks.