A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network coding based reliable disjoint and braided multipath routing for sensor networks
Journal of Network and Computer Applications
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
On counteracting byzantine attacks in network coded peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Secure network coding against wiretapping and Byzantine attacks
EURASIP Journal on Wireless Communications and Networking
Adaptive data-driven service integrity attestation for multi-tenant cloud systems
Proceedings of the Nineteenth International Workshop on Quality of Service
Data obfuscation with network coding
Computer Communications
Efficiency of secure network coding schemes
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Information security in a random network coding network
Problems of Information Transmission
| Hi-index | 754.84 |
An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code.