|
 |
Secure Networking Using Network Coding |
[Overview]
[Students]
[Publications]
[Funding]
This project determines the fundamental limits of network secrecy from
a network coding perspective, and then applies this theory to improve
security guarantees in peer-to-peer and wireless networks. As network
coding gains prominence as an important strategy for both wired and
wireless networks, the project identifies both the advantages and
vulnerabilities from using network coding. Subsequently, the effort
develops a design methodology that exploits the advantages while
carefully compensating for the vulnerabilities.
This project analyzes networks under both outsider and insider
attacks. Specifically, coding mechanisms are developed to combat an
external eavesdropper. Also, a combination of cryptographic and
information-theoretic tools are used to combat internal modification
attacks on the network. The results are then used in two case studies:
eavesdropper attacks on wireless mesh networks and pollution attacks
on P2P content distribution systems.
Secure network coded systems, once well understood, can greatly impact
how networks are designed and deployed. Nearly every network setting
(wireless, wired or heterogeneous) can benefit in terms of improved
resilience (in addition to other performance benefits such as
throughput) in its design. Case studies in this effort are designed to
help transition the theoretical principles developed into practical
algorithms.
Journals
|
On the Practicality of Cryptographic Defenses against Pollution Attacks in Wireless Network Coding.
Andrew Newell, Jing Dong, and Cristina Nita-Rotaru. To appear in ACM Computing Surveys.
|
|
Pollution Attacks and Defense in Inter-flow Network Coding Systems.
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru, and David Yau. To appear in IEEE
Transactions on Dependable and Secure Systems, March 2012.
|
|
Practical Defenses Against Pollution Attacks in Wireless Network Coding.
Jing Dong, Reza Curtmola, and Cristina Nita-Rotaru. In ACM Transactions on Systems and Information Security, vol. 14 no. 1, May 2011.
|
|
Secure Network Coding for Wireless Mesh Networks: Threats, Challenges, and Directions.
Jing Dong, Reza Curtmola, and Cristina Nita-Rotaru. In Computer Communications (Elsevier), Nov 2009.
[PDF][BIBTEX]
|
Conferences
|
Split Null Keys: A Null Space Based Defense for Pollution Attacks in Wireless Network Coding.
Andrew Newell and Cristina Nita-Rotaru.
To appear in Proc. of IEEE Communications Society Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON), June 2012.
|
|
Entropy Attacks and Countermeasures in Wireless Network Coding.
Andrew Newell, Reza Curtmola, and Cristina Nita-Rotaru. To appear in Proc. of ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec), Apr. 2012.
|
|
Key Agreement for Wireless Networks in the Presence of Active Adversaries.
Hongyi Yao, Tracey Ho, and Cristina Nita-Rotaru. In Proc. of Asilomar Conference on Signals, Systems, and Computers, 6 pages, Nov. 2011.
[PDF]
|
|
Pollution Attacks and Defenses in Wireless Inter-flow Network Coding Systems.
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru, and David Yau. In Workshop on Wireless Network Coding with SECON 2010.
|
Current Members
Collaborators and Previous Members
This project is funded by the NSF NETS Program, Collaborative Research: Secure Networking Using Network Coding, Team: Tracey Ho (Caltech), Cristina Nita-Rotaru (Purdue University), Emina Soljanin (Bell Labs), and Sriram Vishwanath (UT Austin). This award is funded under the American Recovery and Reinvestment Act
of 2009 (Public Law 111-5).
|
|
