Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/119051
Title: | Runtime verification for trustworthy computing |
Authors: | Abela, Robert Colombo, Christian Curmi, Axel Fenech, Mattea Vella, Mark Joseph Ferrando, Angelo |
Keywords: | Computer software -- Verification Computer engineering Formal methods (Computer science) Computer logic Computer software -- Development |
Issue Date: | 2023 |
Citation: | Abela, R., Colombo, C., Curmi, A., Fenech, M., Vella M., & Ferrando A. (2023). Runtime Verification for Trustworthy Computing. Proceedings of the Third Workshop on Agents and Robots for reliable Engineered Autonomy (AREA), Krakow. |
Abstract: | Autonomous and robotic systems are increasingly being trusted with sensitive activities with potentially serious consequences if that trust is broken. Runtime verification techniques present a natural source of inspiration for monitoring and enforcing the desirable properties of the communication protocols in place, providing a formal basis and ways to limit intrusiveness. A recently proposed approach, RV-TEE, shows how runtime verification can enhance the level of trust to the Rich Execution Environment (REE), consequently adding a further layer of protection around the Trusted Execution Environment (TEE). By reflecting on the implication of deploying RV in the context of trustworthy computing, we propose practical solutions to two threat models for the RV-TEE monitoring process: one where the adversary has gained access to the system without elevated privileges, and another where the adversary gains all privileges to the host system but fails to steal secrets from the TEE. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/119051 |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Runtime_verification_for_trustworthy_computing.pdf Restricted Access | 561.6 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.