{"title":"关于定位拜占庭攻击者","authors":"Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi","doi":"10.1109/NETCOD.2008.4476182","DOIUrl":null,"url":null,"abstract":"We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"On Locating Byzantine Attackers\",\"authors\":\"Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi\",\"doi\":\"10.1109/NETCOD.2008.4476182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.\",\"PeriodicalId\":186056,\"journal\":{\"name\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2008.4476182\",\"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 Fourth Workshop on Network Coding, Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2008.4476182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
