Signing a Linear Subspace: Signature Schemes for Network Coding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Secure Error-Correction Network Coding in a Randomized Setting
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Training overhead for decoding random linear network codes in wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Wiretap channel type II with an active eavesdropper
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Design of efficient robust network codes for multicast connections
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On noncoherent correction of network errors and erasures with random locations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On metrics for error correction in network coding
IEEE Transactions on Information Theory
Against wiretappers without key: security is an intrinsic property of network coding
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
RIPPLE authentication for network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Robust network coding in the presence of untrusted nodes
IEEE Transactions on Information Theory
Communication over finite-field matrix channels
IEEE Transactions on Information Theory
Homomorphic network coding signatures in the standard model
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
Secure network coding over the integers
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Preventing pollution attacks in multi-source network coding
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient network coding signatures in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Automatica (Journal of IFAC)
Compressed error and erasure correcting codes via rank-metric codes in random network coding
International Journal of Communication Systems
Secret Error Control Codes Against Malicious Attacks in Random Multisource Network Coding
Wireless Personal Communications: An International Journal
Information security in a random network coding network
Problems of Information Transmission
Defending collaborative false data injection attacks in wireless sensor networks
Information Sciences: an International Journal
| Hi-index | 755.02 |
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam links, our first algorithm achieves a rate of , where is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of . Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.