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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. National Computer Conference, vol. 48, pp. 313–317 (1979)
Barbero, Á.I., Ytrehus, Ø.: Cycle-logical treatment for ”Cyclopathic” networks. IEEE Transactions on Information Theory 52(6), 2795–2804 (2006)
Cai, N., Yeung, R.W.: Secure network coding. In: Proc. IEEE International Symposium on Information Theory, vol. 323 (2002)
Feldman, J., Malkin, T., Servedio, R.A., Stein, C.: On the Capacity of Secure Network Coding. In: Proc. 42nd Annual Allerton Conference on Communication, Control and Computing (2004)
Hassanzadeh, M.M., Ravanbakhsh, M., Ytrehus, Ø.: Two Layer Secure Network Coding – (2-LSNC). In: 4th Biannual International Symposium on Telecommunications, Tehran, Iran (submitted, 2008)
Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.M.G.M.: Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory 51(6), 1973–1982 (2005)
Lima, L., Medard, M., Barros, J.: Random linear network coding: a free cipher? In: Proc. IEEE International Symposium on Information Theory, Nice, France (2007)
Lun, D.S., Ratnakar, N., Medard, M., Koetter, R., Karger, D.R., Ho, T., Ahmed, E., Zhao, F.: Minimum-cost multicast over coded packet networks. IEEE Transactions on Information Theory 52(6), 2608–2623 (2006)
Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)
Shamir, A.: How to share a secret. Communications of the ACM 22(1), 612–613 (1979)
Winter, P.: Steiner problem in networks: A survey. Networks 17, 129–167 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravanbakhsh, M., Hassanzadeh, M.M., Haugland, D. (2008). Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization. In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-87448-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87447-8
Online ISBN: 978-3-540-87448-5
eBook Packages: Computer ScienceComputer Science (R0)