Network Coding is a new possibility to transmit data through a network. By combining different packets instead of simply forwarding, network coding offers the opportunity to reach the Min-Cut/Max-Flow capacity in multicast data transmissions. However, the basic schemes are vulnerable to so-called pollution attacks, where an attacker can jam large parts of the transmission by infiltrating only one bogus message. In the literature we found several approaches which aim at handling this kind of attack with different amounts of overhead. Though, the cost for a specific secure network coding scheme highly depends on the underlying network. The goal of this paper is on the one hand to describe which network parameters influence the efficiency of a certain scheme and on the other hand to provide concrete suggestions for selecting the most efficient secure network coding scheme considering a given network. We will illustrate that there does not exist “the best” secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:27312 |
| Date | January 2013 |
| Creators | Pfennig, Stefan, Franz, Elke |
| Publisher | Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Source | IEEE International Conference on Communications (ICC 2013), pp. 2100-2105, ISSN: 1550-3607, 2013 June 9-13. |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 10.1109/ICC.2013.6654836 |
Page generated in 0.0019 seconds