Symbolic Models for Isolated Execution Environments

Jacomme, Charlie; Kremer, Steve; Scerri, Guillaume

doi:10.1109/eurosp.2017.16

Cited by 7 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With their proposed utility theorem, they presented the first SOC framework using trusted hardware, which also offers formal security analysis by simulation-based proof. Another formal treatment for TEE-based SOC is the symbolic model [70,137], which aims to design secure remote attestation execution protocols.…”

Section: Secure Computation Using Teesmentioning

confidence: 99%

A Survey of Secure Computation Using Trusted Execution Environments

Li¹,

Yang²,

Xiang³

et al. 2023

Preprint

View full text Add to dashboard Cite

As an essential technology underpinning trusted computing, the trusted execution environment (TEE) allows one to launch computation tasks on both on-and off-premises data while assuring confidentiality and integrity. This article provides a systematic review and comparison of TEE-based secure computation protocols. We first propose a taxonomy that classifies secure computation protocols into three major categories, namely secure outsourced computation, secure distributed computation and secure multi-party computation. To enable a fair comparison of these protocols, we also present comprehensive assessment criteria with respect to four aspects: setting, methodology, security and performance. Based on these criteria, we review, discuss and compare the state-of-the-art TEE-based secure computation protocols for both general-purpose computation functions and special-purpose ones, such as privacy-preserving machine learning and encrypted database queries. To the best of our knowledge, this article is the first survey to review TEE-based secure computation protocols and the comprehensive comparison can serve as a guideline for selecting suitable protocols for deployment in practice. Finally, we also discuss several future research directions and challenges.CCS Concepts: • Security and privacy → Tamper-proof and tamper-resistant designs; Trust frameworks; Privacy-preserving protocols; Management and querying of encrypted data.

show abstract

Section: Secure Computation Using Teesmentioning

confidence: 99%

A Survey of Secure Computation Using Trusted Execution Environments

Li¹,

Yang²,

Xiang³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…However, different studies have reported that the former two options have sev-eral weaknesses as compared to Tamarin-prover [33], [100], [101]. For example, Scyther does not support user-specified equational theories and relies only on a set of fixed cryptographic primitives [33], [100], [102], [103]. ProVerif does not have this problem, however, it experiences difficulties when dealing with precise states within the protocol description [100], [102], [103].…”

Section: Security Verification Using the Tamarin-provermentioning

confidence: 99%

“…For example, Scyther does not support user-specified equational theories and relies only on a set of fixed cryptographic primitives [33], [100], [102], [103]. ProVerif does not have this problem, however, it experiences difficulties when dealing with precise states within the protocol description [100], [102], [103]. This makes the tool susceptible to false attacks [101].…”

Section: Security Verification Using the Tamarin-provermentioning

confidence: 99%

A Physical Layer, Zero-Round-Trip-Time, Multifactor Authentication Protocol

Mitev¹,

Shekiba-Herfeh²,

Chorti³

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Lightweight physical layer security schemes that have recently attracted a lot of attention include physical unclonable functions (PUFs), RF fingerprinting / proximity based authentication and secret key generation (SKG) from wireless fading coefficients. In this paper, we propose a fast, privacy-preserving, zero-round-trip-time (0-RTT), multi-factor authentication protocol, that for the first time brings all these elements together, i.e., PUFs, proximity estimation and SKG. We use Kalman filters to extract proximity estimates from real measurements of received signal strength (RSS) in an indoor environment to provide soft fingerprints for node authentication. By leveraging node mobility, a multitude of such fingerprints are extracted to provide resistance to impersonation type of attacks e.g., a false base station. Upon removal of the proximity fingerprints, the residual measurements are then used as an entropy source for the distillation of symmetric keys and subsequently used as resumption secrets in a 0-RTT fast authentication protocol. Both schemes are incorporated in a challenge-response PUF-based mutual authentication protocol, shown to be secure through formal proofs using Burrows, Abadi, and Needham (BAN) and Mao and Boyd (MB) logic, as well as the Tamarin-prover. Our protocol showcases that in future networks purely physical layer security solutions are tangible and can provide an alternative to public key infrastructure in specific scenarios.

show abstract

A Symbolic Model for Systematically Analyzing TEE-Based Protocols

Zhao

et al. 2020

Information and Communications Security

View full text Add to dashboard Cite

Symbolic Models for Isolated Execution Environments

Cited by 7 publications

References 24 publications

A Survey of Secure Computation Using Trusted Execution Environments

A Survey of Secure Computation Using Trusted Execution Environments

A Physical Layer, Zero-Round-Trip-Time, Multifactor Authentication Protocol

A Symbolic Model for Systematically Analyzing TEE-Based Protocols

Contact Info

Product

Resources

About