Using RSA Digital Signature to Solve Pollution Problem in Single-Source Network Coding

Rami S. Youail

doi:10.25212/lfu.qzj.2.2.46

Authors

Rami S. Youail Department of Information System Engineering, Erbil Polytechnic University-Iraq

DOI:

https://doi.org/10.25212/lfu.qzj.2.2.46

Keywords:

Network coding, pollution problem, RSA encryption algorithm, digital signature, authentication.

Abstract

Pollution problem in network coding becomes a serious problem, where no receiver can be reached by a source it does not need, in other words, the intermediate nodes may send polluted or faked messages into the network. This injection will prevent the sinks nodes from recovering the original messages correctly. Additionally, a malicious node can inject garbage into the distribution network, if undetected; the garbage will pollute the whole network. The most difficult problem in pollution propagation is the expansion of pollution. If a small number of polluted packets/messages is not detected at the early stages of the network; these small polluted messages will be expanded and used by downstream nodes and will affect the entire network. Therefore, the polluted or forged messages should be detected and filtered as early as possible before it grows up and distributed overall the network. To overcome this problem, a signature-based authentication system is proposed, which can detect the
polluted or forged message at each intermediate/sink node. The system only needs to transmit the private key of the source node to each intermediate node.

Downloads

Download data is not yet available.

References

R. Ahlswede, N. Cai, S. Li, R. Yeung, “Network information flow,” IEEE Transaction on Information Theory, vol. 46, no. 4, pp 1204-1216, 2000.

Y. Wu, ”On constructive multi-source network coding”, in IEEE International Symposium in Information Theory, Seattle, July 9-14, 2006.

S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, ”Resilient network coding in the presence of byzantine adversaries”, IEEE Proceeding INFOCOM, 2007.

Gkantsidis, P. R. Rodriguez, “Cooperative security for network coding file distribution,” IEEE Proceedings INFOCOM, 2006.

A. Menezes, P. V. Oorschot, S. Vnastone, Handbook of Applied Cryptography, 5th. ed. Florida: CRC Press, 2011.

J. Talbot, D. Welsh, Complexity and Cryptography, 1st. ed., Cambridge, Cambridge University Press, 2006.

L. Harn, “Batch verification multiple RSA digital signature,” IEEE Xplore, vol. 10, Issue 12, pp. 1219-1220, 11 June, 1998.

M. Bellare, J.A. Garay, T. Rabin, “Fast batch verification for modular exponentiation and digital signature”, Proceedings of Advances in Cryptography, LNCS, vol. 1403, 1998