Show simple item record

dc.contributor.advisorAlexander, Perry
dc.contributor.authorJurgensen, Grant Alan
dc.date.accessioned2023-05-23T14:24:56Z
dc.date.available2023-05-23T14:24:56Z
dc.date.issued2022-05-31
dc.date.submitted2022
dc.identifier.otherhttp://dissertations.umi.com/ku:18223
dc.identifier.urihttps://hdl.handle.net/1808/34202
dc.description.abstractRemote attestation is a process where one digital system gathers and provides evidence of its state and identity to an external system. For this process to be successful, the external system must find the evidence convincingly trustworthy within that context. Remote attestation is difficult to make trustworthy due to the external system’s limited access to the attestation target. In contrast to local attestation, the appraising system is unable to directly observe and oversee the attestation target. In this work, we present a system architecture design and prototype implementation that we claim enables trustworthy remote attestation. Furthermore, we formally model the system within a temporal logic embedded in the Coq theorem prover and present key theorems that strengthen this trust argument.
dc.format.extent54 pages
dc.language.isoen
dc.publisherUniversity of Kansas
dc.rightsCopyright held by the author.
dc.subjectComputer science
dc.subjectComputation Tree Logic
dc.subjectFormal Methods
dc.subjectRemote Attestation
dc.subjectseL4
dc.subjectTheorem Proving
dc.subjectVerification
dc.titleA Verified Achitecture for Trustworthy Remote Attestation
dc.typeThesis
dc.contributor.cmtememberDavidson, Drew
dc.contributor.cmtememberMoore, Matthew
dc.thesis.degreeDisciplineElectrical Engineering & Computer Science
dc.thesis.degreeLevelM.S.
dc.identifier.orcidhttps://orcid.org/0000-0001-6292-8558en_US
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record