Optimizing Memory-Corruption Security Defenses for Real-Time Systems
Real-Time Systems (RTSs) frequently suffer from memory-corruption attacks. Compared to general-purpose systems, RTSs differ because of their scheduling requirements. For this reason, many modern-day security defenses are not compatible with RTSs or impose too much performance overhead to be schedula...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2022
|
| Online Access: | https://hdl.handle.net/1721.1/144658 |
| _version_ | 1811085231691661312 |
|---|---|
| author | Horne, Amanda |
| author2 | Ward, Bryan |
| author_facet | Ward, Bryan Horne, Amanda |
| author_sort | Horne, Amanda |
| collection | MIT |
| description | Real-Time Systems (RTSs) frequently suffer from memory-corruption attacks. Compared to general-purpose systems, RTSs differ because of their scheduling requirements. For this reason, many modern-day security defenses are not compatible with RTSs or impose too much performance overhead to be schedulable. This thesis presents a new Mixed Integer Linear Programming optimization algorithm — Defense Optimization Algorithm for Real-time system Memory-Corruption Security (DOARMS) — that determines the optimal, yet schedulable, set of defenses to protect RTSs against memory-corruption attacks.
Experiments using DOARMS showed that 71% or less utilization is needed for ideal security coverage with the defenses considered and that the algorithm produced better results than selecting the defenses with the best security coverage. A case-study using a smaller subset of defenses also showed that using worst-case instead of average-case performance overheads for defenses leads to lower security coverage, and that more work is needed to quantify the worst-case performance overheads. DOARMS also supports optional weights representing the importance of security for each task and prioritizes the security of the tasks according to those weights. The runtime performance of the algorithm is reasonable with a single optimization taking an average of ∼ 14s and a maximum of ∼ 114s to run, making it a useful tool to help RTS designers secure their RTSs from memory-corruption attacks. |
| first_indexed | 2024-09-23T13:05:44Z |
| format | Thesis |
| id | mit-1721.1/144658 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:05:44Z |
| publishDate | 2022 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1446582022-08-30T03:31:12Z Optimizing Memory-Corruption Security Defenses for Real-Time Systems Horne, Amanda Ward, Bryan Burow, Nathan Shrobe, Howard Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Real-Time Systems (RTSs) frequently suffer from memory-corruption attacks. Compared to general-purpose systems, RTSs differ because of their scheduling requirements. For this reason, many modern-day security defenses are not compatible with RTSs or impose too much performance overhead to be schedulable. This thesis presents a new Mixed Integer Linear Programming optimization algorithm — Defense Optimization Algorithm for Real-time system Memory-Corruption Security (DOARMS) — that determines the optimal, yet schedulable, set of defenses to protect RTSs against memory-corruption attacks. Experiments using DOARMS showed that 71% or less utilization is needed for ideal security coverage with the defenses considered and that the algorithm produced better results than selecting the defenses with the best security coverage. A case-study using a smaller subset of defenses also showed that using worst-case instead of average-case performance overheads for defenses leads to lower security coverage, and that more work is needed to quantify the worst-case performance overheads. DOARMS also supports optional weights representing the importance of security for each task and prioritizes the security of the tasks according to those weights. The runtime performance of the algorithm is reasonable with a single optimization taking an average of ∼ 14s and a maximum of ∼ 114s to run, making it a useful tool to help RTS designers secure their RTSs from memory-corruption attacks. M.Eng. S.B. 2022-08-29T16:02:45Z 2022-08-29T16:02:45Z 2022-05 2022-02-22T18:32:26.698Z Thesis https://hdl.handle.net/1721.1/144658 In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology |
| spellingShingle | Horne, Amanda Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title | Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title_full | Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title_fullStr | Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title_full_unstemmed | Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title_short | Optimizing Memory-Corruption Security Defenses for Real-Time Systems |
| title_sort | optimizing memory corruption security defenses for real time systems |
| url | https://hdl.handle.net/1721.1/144658 |
| work_keys_str_mv | AT horneamanda optimizingmemorycorruptionsecuritydefensesforrealtimesystems |