Page 1 |
Save page Remove page | Previous | 1 of 123 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
EFFICIENT METHODS FOR ENHANCING SECURE NETWORK CODES
by
Joyce Liang
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(ELECTRICAL ENGINEERING)
May 2012
Copyright 2012 Joyce Liang
Object Description
| Title | Efficient methods for enhancing secure network codes |
| Author | Liang, Joyce |
| Author email | joyce.c.liang@gmail.com;joycelia@usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2012-01-27 |
| Date submitted | 2012-03-14 |
| Date approved | 2012-03-15 |
| Restricted until | 2012-03-15 |
| Date published | 2012-03-15 |
| Advisor (committee chair) | Kuo, C.-C. Jay |
| Advisor (committee member) |
Zhang, Zhen Golubchik, Leana |
| Abstract | Network coding has been studied extensively in the last decade, during which it has been linked to applications in throughput gain, error correction, robustness to non-ergodic link failures, confidentiality, and security. It can be efficiently implemented through low com- plexity linear operations, over both wired and wireless networks. Network coding may also be utilized in both centralized and decentralized designs, where it has been shown to outperform traditional routing techniques. Despite its potential, network coding must still abide by the same fundamental tradeoffs. These tradeoffs are rarely treated in the literature that studies each of its merits in isolation. We feature a holistic approach to network coding in the areas of security, efficiency, and robustness against erasures. Joint examination yields design considerations that require flexible parameters to analyze tradeoffs between desired algorithmic features. ❧ For the first topic, we present a novel algorithm that achieves robust and secure shar- ing based on network coding among multiple trusted peers in wireless erasure networks. In the considered communication model, an eavesdropper can take advantage of the broadcast medium to tap messages along a min-cut. The fundamental tradeoff between secrecy, robustness and efficiency enforced by the wireless environment is examined. In situations where there is no secure capacity, we give a convolutional NC scheme that achieves weak secrecy to decrease the number of symmetric keys required. We further propose methods to increase communication efficiency using the algorithm at the cost of robustness or privacy. Finally, we show that network erasures can actually increase the amount of secrecy in the proposed scheme but at the cost of decreased efficiency. ❧ For the second topic, an algorithm is presented that efficiently hides the global coding kernels as an alternative method to providing privacy in a single source multicast network that employs network coding. Unlike the majority of secure network coding algorithms, the proposed algorithm continues a very recent trend that instead focuses on preventing the adversary from ascertaining any global or local mappings. Without the global coding matrix, the adversary is unable to recover the secret source messages. We address a more powerful adversary that not only removes all wiretap restrictions featured in previous works, but we also assume that the adversary has the ability to manipulate source messages. The adversarial goal is therefore to obtain information about the global coding matrix by chosen plaintext attacks. Our algorithm is novel in the sense that the source node codes messages based on the secretly indexed set of coding vectors, rather than independently selecting each coefficient. By reducing the size of this finite pool, we may achieve enormous gains in overhead savings, which increase utilizable network capacity. The impact of the field size and the size of the vector pool on both security and efficiency is discussed. The cost metric used is the number of bits that need to be encrypted each generation. |
| Keyword | network coding; secrecy; robustness |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Contributing entity | University of Southern California |
| Rights | Liang, Joyce |
| Physical access | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@lib.usc.edu |
| Archival file | uscthesesreloadpub_Volume6/etd-LiangJoyce-501.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | EFFICIENT METHODS FOR ENHANCING SECURE NETWORK CODES by Joyce Liang A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (ELECTRICAL ENGINEERING) May 2012 Copyright 2012 Joyce Liang |
