Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization

Authors:
Mohammad Ravanbakhsh;Mehdi M. Hassanzadeh;Dag Haugland
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway N-5020;Department of Informatics, University of Bergen, Bergen, Norway N-5020;Department of Informatics, University of Bergen, Bergen, Norway N-5020
Venue:
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Year:
2008

Citing 7
Cited 0

Steiner problem in networks: a survey

Networks
How to share a secret

Communications of the ACM
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cycle-logical treatment for "Cyclopathic" networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new type of attack on secure network coding is introduced in this paper. In this model, network nodes, which handle the traffic from the source node to sink nodes are potentially viewed to be corruptible. We study the maximum security capacity for this problem for a single- source single-sink scenario, and we generalize our study for multicast with network coding. Based on our study, two optimization problems are introduced to increase the security against the attacks under study. We have shown by simulation results that our proposed optimization method has increased the security against node corruption considerably, and at the same time, the cost per level of security is lower compared to optimization methods without constraints on node corruption.