Google Scholar

##plugins.themes.academic_pro.article.sidebar##

Published
Jun 29, 2015
Download
PDF
Statistic
Read Counter : 24 Download : 71

Downloads

Download data is not yet available.

##plugins.themes.academic_pro.article.main##

Abstract

Network coding based applications are notoriously susceptible to malicious pollution attacks. Packets authentication schemes have been well-recognized as the most effective approach to address this security threat. However, existing packets authentication scheme i. e. the Times keys scheme consumes extra bandwidth for transmission of times keys. Also the Time keys can be captured and replay attack can be launched by the attacker. This motivates to design a new solution to avoid the problems in Time keys scheme. The solution is based on the concept that the source and the destination must agree on the keys along with the network coding process. This scheme of agreeing on the keys is known as adaptive TESLA scheme. Using this proposed scheme the effect of pollution attack and collusion attack is measured in terms of real packets corrupted and dropped. The proposed adaptive TESLA scheme for network coding is also compared with times keys in terms of bandwidth usages.

Keywords: network coding, pollution attack, collusion attack, adaptive TESLA.

##plugins.themes.academic_pro.article.details##

How to Cite
Shyamsundar Gupta, A. J. (2015). An Efficient Dynamic TESLA based Authentication Scheme for Secure Network Coding. International Journal of Emerging Trends in Science and Technology, 2(06). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/772

References

1. Ming He • Zhenghu Gong • Lin Chen • HongWang • Fan Dai • Zhihong Liu “Securing network coding against pollution attacks in P2P converged ubiquitous networks” Springer Science , Published online 26 June 2013
2. Frédérique Oggier and Hanane Fathi “An Authentication Code Against Pollution Attack” in Network Coding, Proc. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 6, DECEMBER 2011.
3. Jing Dong, Reza Curtmola, Cristina Nita-Rotaru, “Practical Defenses Against Pollution Attacks in Intra-Flow Network Coding for Wireless Mesh Networks” WiSec’09, March 16–18, 2009, Zurich, Switzerland.
4. F. Oggier and H. Fathi, “Multi-receiver authentication codes for network coding,” in Proc. 46th Annu. Allerton Conf. Commun., Control, Comput., 2008, pp. 1225–1231.
5. P. Chou, Y. Wu, and K. Jain, “Practical network coding,” in Proc. Allerton Conf. Commun., Control, Comput., 2003, pp. 40–49.
6. R. Ahlswede, N. Cai, S. Li, and R. Yeung, “Network Information Flow,” IEEE Trans. Information vol. 46, no. 4, pp. 1204-1216, July 2000.
A.Perrig Ran Canetti, J. D. Tygar, D, “The TESLA Broadcast Authentication Protocol” in CrypoBytes, 5:2, Summer/ Fall 2002, pp 2-13.