Blockchain-based containment of computer worms
| dc.contributor.author | Elsayed, Mohamed Ahmed Seifeldin Mohamed | |
| dc.contributor.supervisor | Gulliver, T. Aaron | |
| dc.date.accessioned | 2020-12-23T06:35:39Z | |
| dc.date.available | 2020-12-23T06:35:39Z | |
| dc.date.copyright | 2020 | en_US |
| dc.date.issued | 2020-12-22 | |
| dc.degree.department | Department of Electrical and Computer Engineering | |
| dc.degree.level | Doctor of Philosophy Ph.D. | en_US |
| dc.description.abstract | Information technology systems are essential for most businesses as they facilitate the handling and sharing of data and the execution of tasks. Due to connectivity to the internet and other internal networks, these systems are susceptible to cyberattacks. Computer worms are one of the most significant threats to computer systems because of their fast self-propagation to multiple systems and malicious payloads. Modern worms employ obfuscation techniques to avoid detection using patterns from previous attacks. Although the best defense is to eliminate (patch) the software vulnerabilities being exploited by computer worms, this requires a substantial amount of time to create, test, and deploy the patches. Worm containment techniques are used to reduce or stop the spread of worm infections to allow time for software patches to be developed and deployed. In this dissertation, a novel blockchain-based collaborative intrusion prevention system model is introduced. This model is designed to proactively contain zero-day and obfuscated computer worms. In this model, containment is achieved by creating and distributing signatures for the exploited vulnerabilities. Blockchain technology is employed to provide liveness, maintain an immutable record of vulnerability-based signatures to update peers, accomplish trust in confirming the occurrence of a malicious event and the corresponding signature, and allow a decentralized defensive environment. A consensus algorithm based on the Practical Byzantine Fault Tolerance (PBFT) algorithm is employed in the model. The TLA+ formal method is utilized to check the correctness, liveness, and safety properties of the model as well as to assert that it has no behavioral errors. A blockchain-based automatic worm containment system is implemented. A synthetic worm is created to exploit a network-deployed vulnerable program. This is used to evaluate the effectiveness of the containment system. It is shown that the system can contain the worm and has good performance. The system can contain 100 worm attacks a second by generating and distributing the corresponding vulnerability-based signatures. The system latency to contain these attacks is less than 10 ms. In addition, the system has low resource requirements with respect to memory, CPU, and network traffic. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/12492 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Worm Containment | en_US |
| dc.subject | Intrusion Response | en_US |
| dc.subject | Practical Byzantine Fault Tolerance (PBFT) | en_US |
| dc.subject | Distributed Host-based Intrusion Prevention | en_US |
| dc.subject | Worm Signature Generation | en_US |
| dc.subject | Blockchain-based Containment | en_US |
| dc.subject | Dynamic Taint Analysis Detection | en_US |
| dc.subject | Vulnerability-based Worm Signatures | en_US |
| dc.subject | TLA+ Formal Method | en_US |
| dc.title | Blockchain-based containment of computer worms | en_US |
| dc.type | Thesis | en_US |