{"title":"安全纠错(SEC)网络代码","authors":"C. Ngai, R. Yeung","doi":"10.1109/NETCOD.2009.5191401","DOIUrl":null,"url":null,"abstract":"We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Secure error-correcting (SEC) network codes\",\"authors\":\"C. Ngai, R. Yeung\",\"doi\":\"10.1109/NETCOD.2009.5191401\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.\",\"PeriodicalId\":251096,\"journal\":{\"name\":\"2009 Workshop on Network Coding, Theory, and Applications\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Workshop on Network Coding, Theory, and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2009.5191401\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Workshop on Network Coding, Theory, and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2009.5191401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
