Runtime Verification for Trustworthy Computing

Robert Abela
(University of Malta)
Christian Colombo
(University of Malta)
Axel Curmi
(University of Malta)
Mattea Fenech
(University of Malta)
Mark Vella
(University of Malta)
Angelo Ferrando
(University of Genoa)

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.

In Angelo Ferrando and Rafael Cardoso: Proceedings of the Third Workshop on Agents and Robots for reliable Engineered Autonomy (AREA 2023), Krakow, Poland, 1st October 2023, Electronic Proceedings in Theoretical Computer Science 391, pp. 49–62.
Published: 30th September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.391.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org