Abstract
We propose a method for providing anonymity and security of data transmission in networks with network coding with multiple sources and receivers. An external passive adversary is assumed to be present in the network. It is required to organize message transmission in such a manner that the adversary cannot trace a message route. The proposed method is a modification of a secure transmission scheme based on coset coding. We show that using an additional operation at relaying nodes enables to remove statistical dependence between incoming and outgoing messages of the relaying nodes. This makes tracing message routes impossible. An overlay network between a source and a receiver must be constructed due to restrictions on routes between the source and receiver: the minimum cut between two successive nodes must be not less than the number of packets in the encoded source message.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gabidulin, E.M. and Trushina, O.V., Anonymous and Security Network Coding, in Proc. 7th Int. Workshop on Optimal Codes and Related Topics (OC’2013), Albena, Bulgaria, Sept. 6–12, 2013, pp. 85–90.
Ahlswede, R., Cai, N., Li, S.R., and Yeung, R.W., Network Information Flow, IEEE Trans. Inform. Theory, 2000, vol. 46, no. 4, pp. 1204–1216.
Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., and Leong, B., A Random Linear Network Coding Approach to Multicast, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 10, pp. 4413–4430.
Lehman, A.R. and Lehman, E., Complexity Classification of Network Information Flow Problems, in Proc. 15th Annual ACM-SIAM Sympos. on Discrete Algorithms, New Orleans, LA, Jan. 11–13, 2004, pp. 142–150.
Meng, C., Seferoglu, H., Markopoulou, A., Shum, K.W., and Chang, C., Multicast Packing for Coding across Multiple Unicasts, in Proc. 2013 Int. Sympos. on Network Coding (NetCod’2013), Calgary, Alberta, Canada, June 7–9, 2013, pp. 37–42.
Traskov, D., Ratnakar, N., Lun, D.S., Koetter, R., and Médard, M., Network Coding for Multiple Unicasts: An Approach Based on Linear Optimization, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT’2006), Seattle, WA, July 9–14, 2006, pp. 1758–1762.
Gabidulin, E.M., Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1–12].
Silva, D. and Kschischang, R., Universal Secure Network Coding via Rank-Metric Codes, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 2, pp. 1124–1135.
Ozarow, L.H. and Wyner, A.D., Wire-Tap Channel II, AT &T Bell Labs. Tech. J., 1984, vol. 63, no. 10, pp. 2135–2157.
Silva, D., Kschischang, F.R., and Koetter, R., A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 9, pp. 3951–3967.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © O.V. Trushina, E.M. Gabidulin, 2015, published in Problemy Peredachi Informatsii, 2015, Vol. 51, No. 1, pp. 82–89.
Supported in part by the Russian Foundation for Basic Research, project no. 12-07-00122a.
Rights and permissions
About this article
Cite this article
Trushina, O.V., Gabidulin, E.M. A new method for ensuring anonymity and security in network coding. Probl Inf Transm 51, 75–81 (2015). https://doi.org/10.1134/S0032946015010081
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946015010081