Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/140029| Title: | Code attestation for monitor compromise detection |
| Authors: | Mifsud, Matthew (2025) |
| Keywords: | Computer security Formal methods (Computer science) Computer software -- Verification Java virtual machine Java (Computer program language) Computer network protocols |
| Issue Date: | 2025 |
| Citation: | Mifsud, M. (2025). Code attestation for monitor compromise detection (Bachelor’s dissertation). |
| Abstract: | Runtime monitors are programs that observe a system’s execution to detect deviations from expected behaviour. This makes them valuable in security contexts, where they can be used for the detection of malicious activity. However, their effectiveness depends on the assumption that the monitor itself has not been compromised. From an attacker’s point of view, the monitor poses a direct obstacle to evading detection, making it a high-value target. An attacker with sufficient privileges may modify the monitor’s in-memory code to ensure that malicious activity goes undetected. Without strong assurances that the monitor remains secure and untampered, the reliability of the monitoring process, and thus the security of the entire system is undermined. This work addresses this challenge by designing and implementing a remote code attestation mechanism. Remote code attestation is a cryptographic technique in which proofs describing the state of executing code are periodically generated and sent to an external verifier for validation. The proposed solution adopts a challenge–response protocol, where the monitor acts as a prover and responds to unpredictable challenges with attestations of its current code state. Any deviation from the expected state results in a verification failure, enabling timely detection of tampering. Through the development of a prototype and its evaluation under multiple tampering scenarios, we demonstrate that the mechanism reliably detects in-memory code modifications. From our testing, we deduce that full attestation introduces moderate overhead, while an optimisation based on pseudorandom traversal can reduce this cost. This enables flexible trade-offs between performance and security, making remote code attestation both a practical and effective mechanism for detecting tampering of runtime monitors. |
| Description: | B.Sc. (Hons)(Melit.) |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/140029 |
| Appears in Collections: | Dissertations - FacICT - 2025 Dissertations - FacICTCS - 2025 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2508ICTICT391400017203_1.PDF Restricted Access | 870.15 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
