z-logo
open-access-imgOpen Access
Propagating trusted execution through mutual attestation
Author(s) -
Furkan Turan,
Ingrid Verbauwhede
Publication year - 2019
Publication title -
lirias (ku leuven)
Language(s) - English
Resource type - Conference proceedings
ISBN - 978-1-4503-6888-9
DOI - 10.1145/3342559.3365334
Subject(s) - computer science , trusted computing , gas meter prover , field programmable gate array , context (archaeology) , trusted platform module , direct anonymous attestation , state (computer science) , resource (disambiguation) , embedded system , computer security , computer network , programming language , paleontology , mathematics , geometry , biology , mathematical proof
Attestation is used in a trusted computing context to verify the expected good behaviour. It defines a prover and verifier relationship. It requires the presence of an authority if any two devices want to question each other for a sensitive collaborative work. In contrast, the mutual attestation defined in this paper allows the same rank and type devices to directly evaluate each other, and manage their own cooperation. In addition, it provides the attestations with response actions so that a device with an untrusted state can be recovered with the help of others on the network. These features are supported with a Root-of-Trust (RoT) module capable of enforcing actions even on exploited devices. A proof-of-concept FPGA implementation of the proposed RoT module is demonstrated on Zynq SoCs, as an add-on extension to a RISC-V processor for establishing trust between applications of connected devices. Besides, it assists to explore the implementation decisions, abnormal execution situations, resource utilisation, and performance overheads.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom