Oregon State University

Calendar

Calendars

Event Details

PhD Oral Preliminary Examination - Majid Adeli


Tuesday, December 6, 2011 10:00 AM - 12:00 PM

On the Security of Network Coding
As network coding becomes closer to the reality, its security issues become more important and hence get more attention in the literatures. Same as any other type of data routing approach, if network coding is expected to be widely used in practical applications, it will need to satisfy (or preferably exceed) some fundamental security requirements. This thesis mainly focuses on the security aspects of network coding and presents a few new methods to resolve some of the security concerns existing in the network coded data networks.

To counteract passive attacks in network coding, we propose two schemes which both are inspired by the idea of one-time-pad cryptosystem. That is, they conceal the plain information symbols using uniformly distributed noise. The first scheme utilizes hash functions to generate the required randomness. Typical hash functions are complex, and also running them is a time consuming process. Besides this fact, the only noisy symbol (i.e., the key) in the first scheme is somewhat exposed and can be eavesdropped under some certain conditions. These two major concerns in the first scheme motivate us to design the second algorithm in which computationally expensive hash functions are substituted by a simple permutation map and also the security key information is well-concealed inside the transmitted data packet. It is shown that these algorithms outperform their existing competitors in terms of throughput efficiency, security flexibility, and algorithm simplicity.

This thesis also considers active (Byzantine) attacks in network coding and proposes a multilayer hierarchical security algorithm to precisely detect the attack occurrence and locate the Byzantine attackers. Since this class of attacks causes a lot more damage to the security and data transmission process, it is important to isolate the attackers from rest of the network as quickly as possible. The big advantages of our hierarchical scheme are fast convergence and simplicity. It is vital to have a reliable and efficient Byzantine attack detection algorithm because our hierarchical Byzantine locator algorithm is triggered by a Byzantine attack detector. Hence, we will specifically discuss about the active attack detectors and outline some ideas in there.

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


Kelley Engineering Center (campus map)
3114
Ferne Simendinger
1 541 737 2889
ferne at eecs.oregonstate.edu
Sch Elect Engr/Comp Sci
This event appears on the following calendars: