Publication: Information Flow Control for Distributed Trusted Execution Environments
Open/View Files
Date
2019
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Harvard University. Department of Computer Science
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Gollamundi, Anitha, Stephen Chong, and Arden Owen. 2019. Information Flow Control for Distributed Trusted Execution Environments. Harvard Computer Science Group Technical Report TR-01-19.
Research Data
Abstract
Distributed applications cannot assume that their security policies will be enforced on untrusted hosts. Trusted execution environments (TEEs) combined with cryptographic mechanisms enable execution of known code on an untrusted host and the exchange of confidential and authenticated messages with it. TEEs do not, however, establish the trustworthiness of code executing in a TEE. Thus, developing secure applications using TEEs requires specialized expertise and careful auditing.
This paper presents DFLATE, a core security calculus for distributed applications with TEEs. DFLATE offers high-level abstractions that reflect both the guarantees and limitations of the underlying security mechanisms they are based on. The accuracy of these abstractions is exhibited by asymmetry between confidentiality and integrity in our formal results: DFLATE enforces a strong form of noninterference for confidentiality, but only a weak form for integrity. This reflects the asymmetry of the security guarantees of a TEE: a malicious host cannot access secrets in the TEE or modify its contents, but they can suppress or manipulate the sequence of its inputs and outputs. Therefore DFLATE cannot protect against the suppression of high-integrity messages, but when these messages are delivered, their contents cannot have been influenced by an attacker.
Index Terms—information flow control, language-based security, trusted execution environment, enclaves, distributed systems, security
Description
Harvard Computer Science Group Technical Report TR-01-19
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service