A Secure and Robust Authentication Scheme against Pollution Attacks
Journal: International Journal of Research in Information Technology (IJRIT) (Vol.1, No. 1)Publication Date: 2013-01-30
Authors : B. Ramulu; CH. Ravinder Reddy;
Page : 42-47
Keywords : Network Coding; Authentication Scheme; Key Distribution; Pollution Attacks;
Abstract
The pollution attacks are amplified by the network coding process, resulting in a greater damage than under traditional routing. In this paper, this issue is handled by designing an unconditionally secure authentication code suitable for multicast network coding, where the keying material is initially computed and distributed by a trusted authority to the destinations and intermediate nodes. The proposed scheme allows not only destinations, but also intermediate nodes, to verify the integrity and origin of the packets received without having to decode, and thus detect and discard the malicious messages in transit that fail the verification. This way, the pollution is canceled out before reaching the destinations. Systems exploiting network coding to increase their throughput suffer greatly from pollution attacks, which consist of injecting malicious packets in the network. The proposed scheme is robust against pollution attacks from outsiders, as well as coalitions of malicious insider nodes, which have the ability to perform the integrity check, but instead get corrupted and use their knowledge to themselves attack the network. We analyze the performance of the scheme in terms of both throughput and good put.
Other Latest Articles
- Use of Zimmermann Multi Objective Fuzzy Linear Programming model to identify best areas of rice growing in the Dry and Intermediate zones in Sri Lanka
- Serviceable Reactive Programming on Vulnerable Data type
- Fuzzy Indexing Method to Recognize the Ancient Documents
- mportance of Software Re-Engineering Process and Program Based Analysis in Reverse Engineering Process
- Techniques in Cloud Computing for Mobile Streaming of Video - Review
Last modified: 2013-03-04 15:34:33