Oregon State University

Can’t find an event? We’re busy migrating to a new event calendar. Try looking at the new calendar



Event Details

PhD Final Oral Examination – Majid Adeli

Tuesday, June 11, 2013 10:00 AM - 12:00 PM

Security Protocols for Linear Network Coding
Network coding, as the next generation of data routing protocols and as a promising way to enhance and improve various network performance measures such as data throughput and network robustness, has been a research hot spot since its invention a decade ago. The idea of enabling the intermediate nodes in a typical data network to process and encode their input data before forwarding the coded data to the next nodes is the essence and the core notion of network coding. Allowing the network nodes to encode their incoming data symbols instead of just copying them on their outgoing links (as is the case in conventional data routing schemes) causes the content of each data packet to constantly evolve and change as it travels through the network. Regardless of the benefits that this data-evolving property offers the network, when it comes to the security issues, network coding performs as a double-edged sword. That is, although mixing up the data packets at each and every intermediate node provides some degree of confusion for the attacker, in many applications this inherent level of security is not enough. More importantly, the data mixing feature in network coding makes the system very vulnerable to pollution attacks in which an active attacker injects invalid and bogus data into the main data stream.

In this work, we study the subject of security in linear network coding in general and propose several new protocols that effectively counteract various security threats in a linear-network-coding-based network. We classify the security attacks in such networks into two main categories known as passive attacks and active attacks. Next, we elaborate on each proposed security scheme by describing its features and assessing its performance and efficiency from various viewpoints such as data throughput, algorithm complexity, and security assurance.

For the anti-passive-attack protocols, it is shown that our proposed solutions are not only remarkably throughput efficient (with zero or next-to-zero throughput reductions), but also very light-weight and simple with regard to algorithm complexity while the security requirements are also completely satisfied. For anti-active-attack schemes, the hierarchical security solution outlined in this work proved to be much simpler than the existing schemes with the same goals. The multi-tier structure of this algorithm also facilitates the task of accurately pinpointing any number of polluter nodes in a network.

Major Advisor: Huaping Liu
Committee: Bella Bose
Committee: Thinh Nguyen
Committee: Bechir Hamdaoui
GCR: Yevgeniy Kovchegov

Kelley Engineering Center (campus map)
Nicole Thompson
1 541 737 3617
Nicole.Thompson at oregonstate.edu
Sch Elect Engr/Comp Sci
This event appears on the following calendars: