Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding
SUMMARYThis paper investigates the problem of constructing a secret and reliable network coding communication scheme against an adversary that can reselect the μ tapping links in different time slices and inject z erroneous packets into the network, while the network suffers from ρ packet erasures....
Uloženo v:
| Vydáno v: | International journal of communication systems Ročník 26; číslo 5; s. 567 - 582 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Chichester
Blackwell Publishing Ltd
01.05.2013
Wiley Subscription Services, Inc |
| Témata: | |
| ISSN: | 1074-5351, 1099-1131 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | SUMMARYThis paper investigates the problem of constructing a secret and reliable network coding communication scheme against an adversary that can reselect the μ tapping links in different time slices and inject z erroneous packets into the network, while the network suffers from ρ packet erasures. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to eavesdropping attack, and no errors are injected. We then provide two network coding schemes for error and erasure correction, which can decode the transmitted information correctly. With that, a secret and reliable network coding is proposed by combining two error and erasure correction schemes with secret communication. We show that under the requirement of 2z + ρ+ μ < k ⩽2z + 2ρ communication can achieve a rate of k −μ−z −ρ packets, where k denotes the network capacity. Moreover, it ensures that the communicated information has complete reliability and information‐theoretic security from the adversary. In particular, the requirement of packet length does not need to be sufficiently large, which is close to the practical packet length. Finally, we also compare our scheme's performance with existing work; the numeric results and security analyses illustrate the performance and security of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.
In this paper, we construct a secret and reliable network coding scheme against an adversary that can reselect the μ tapping links in different time slices and inject z erroneous packets into the network, while the network suffers from ρ packet erasures. We show that under the requirement of 2z + ρ+ μ < k ⩽ 2z + 2ρ communication can achieve a rate of k −μ−zρ packets, where k denotes network capacity. In particular, the requirement of packet length doesn't need to be sufficiently large, which is close to the practical packet length. |
|---|---|
| Bibliografie: | ark:/67375/WNG-H4VDQ5NW-Z ArticleID:DAC1359 istex:AF3AB78C6580A3EC638B1E439D1AE03A4DD78518 ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1074-5351 1099-1131 |
| DOI: | 10.1002/dac.1359 |