Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
Thesis_Sravya_Bethu_OhioLink_.pdf (505.67 KB)
ETD Abstract Container
Abstract Header
Compromising Random Linear Network Coding as a Cipher
Author Info
Bethu, Sravya
ORCID® Identifier
http://orcid.org/0000-0003-1653-2768
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=csu1655259443981442
Abstract Details
Year and Degree
2022, Master of Computer and Information Science, Cleveland State University, Washkewicz College of Engineering.
Abstract
Due to its potential improvement on network throughput, network coding has attracted considerable research interests. Random Linear Network Coding (RLNC), as a branch of research on network coding, is proposed as a cipher to protect the confidentiality of packets possibly on the future Internet due to its features such as packet mixing in a decentralized approach. In this paper, we propose attacks to compromise RLNC as a cipher for confidentiality protection. The attacks are based on the blind source separation (BSS) technique, a statistical signal processing technique designed to recover original signals based on mixtures of original signals. We also design the scaling step to filter out artifacts generated by BSS algorithms and the cross-checking steps to increase confidence on packets recovered by the proposed attacks. Our extensive experiments on packets collected from the Internet and a campus network show that the attacks can successfully recover about 1% of original packets.
Committee
Ye Zhu (Advisor)
Sunnie Chung (Committee Member)
Sathish Kumar (Committee Member)
Siu-Tung Yau (Committee Member)
Subject Headings
Computer Science
;
Information Science
Keywords
Random Linear Network Coding
;
Independent Component
;
Blind Source Separation
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Bethu, S. (2022).
Compromising Random Linear Network Coding as a Cipher
[Master's thesis, Cleveland State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=csu1655259443981442
APA Style (7th edition)
Bethu, Sravya.
Compromising Random Linear Network Coding as a Cipher.
2022. Cleveland State University, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=csu1655259443981442.
MLA Style (8th edition)
Bethu, Sravya. "Compromising Random Linear Network Coding as a Cipher." Master's thesis, Cleveland State University, 2022. http://rave.ohiolink.edu/etdc/view?acc_num=csu1655259443981442
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
csu1655259443981442
Download Count:
120
Copyright Info
© , all rights reserved.
This open access ETD is published by Cleveland State University and OhioLINK.