Show simple item record

dc.contributor.advisorAlexander, Perry W
dc.contributor.authorPetz, Adam Michael
dc.date.accessioned2017-05-15T00:03:15Z
dc.date.available2017-05-15T00:03:15Z
dc.date.issued2016-12-31
dc.date.submitted2016
dc.identifier.otherhttp://dissertations.umi.com/ku:14918
dc.identifier.urihttp://hdl.handle.net/1808/24137
dc.description.abstractAs our world becomes more connected, the average person must place more trust in cloud systems for everyday transactions. We rely on banks and credit card services to protect our money, hospitals to conceal and selectively disclose sensitive health information, and government agencies to protect our identity and uphold national security interests. However, establishing trust in remote systems is not a trivial task, especially in the diverse, distributed ecosystem of todays networked computers. Remote Attestation is a mechanism for establishing trust in a remotely running system where an Appraiser requests information from a target that can be used to evaluate its operational state. The target responds with evidence providing configuration information, run-time measurements, and authenticity meta-evidence used by the appraiser to determine if it trusts the target system. For Remote Attestation to be applied broadly, we must have Attestation Protocols that perform operations on a collection of applications, each of which must be measured differently. Verifying that these protocols behave as expected and accomplish their diverse attestation goals is a unique challenge. An important first step is to understand the structural properties and execution patterns they share. In this thesis I present a semantic framework for attestation protocol execution within the Coq verification environment including a protocol representation based on Session Types, a dependently typed model of perfect cryptography, and an operational execution semantics. The expressive power of dependent types constrains the structure of protocols and supports precise claims about their behavior. If we view attestation protocols as programming language expressions, we can borrow from standard language semantics techniques to model their execution. The proof framework ensures desirable properties of protocol execution that hold for all protocols. Within this framework, it is feasible to state and prove specialized properties such as authenticity and secrecy for individual protocols.
dc.format.extent61 pages
dc.language.isoen
dc.publisherUniversity of Kansas
dc.rightsCopyright held by the author.
dc.subjectComputer science
dc.subjectCloud Computing
dc.subjectCoq
dc.subjectFormal Methods
dc.subjectProgramming Languages
dc.subjectSoftware Verification
dc.subjectTrusted Computing
dc.titleA Semantics for Attestation Protocols using Session Types in Coq
dc.typeThesis
dc.contributor.cmtememberGill, Andy
dc.contributor.cmtememberKulkarni, Prasad
dc.thesis.degreeDisciplineElectrical Engineering & Computer Science
dc.thesis.degreeLevelM.S.
dc.identifier.orcid
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record