Confidential Computing

Total Page:16

File Type:pdf, Size:1020Kb

Confidential Computing Confidential Computing UK RISE Annual Conference 2020 Ilhan Gurel Ericsson 2020-11-30 | Ilhan Gurel | 2020-11-30 | Open | Page 1 of 19 | Ilhan Gurel | 2020-11-30 | Open | Page 2 of 19 Computing Platforms & Problem Statement ●Compromise of confidentiality ●How to ensure that computing ●code and data are exposed in plain platforms are trustworthy and correct text on computing platforms software is run on them? ●when “in use” ●compromise of user data leading ●Making HW Root of Trust (RoT) to the loss of privacy available to guests in cloud deployments is challenging ●from constrained IoT devices to cloud deployments ●Compromise of IPR ●Compromise of code and data integrity ●e.g. algorithms, ML models,.. | Ilhan Gurel | 2020-11-30 | Open | Page 3 of 19 What does Confidential Computing mean? ●Code and data confidentiality can be achieved at runtime (“in use”) ●e.g. by means of HW based isolation and memory/CPU state encryption technologies ●Data confidentiality and integrity can be protected at rest, in use and in transit ●Code and data cannot be tampered and accessed from outside of the trust boundaries of a secure enclave/trust domain ●Code and data can be measured and attested. ●Confidential Computing is built upon the existing concepts of Trusted Computing … and the relevant technologies allow all of these to be achieved both on bare metal and in virtualized environments | Ilhan Gurel | 2020-11-30 | Open | Page 4 of 19 The relevant technologies AWS Nitro Enclaves Intel MKTME Microsoft Project Cerberus MIT Sanctum Google Titan AMD SEV-SNP TPM 1.2 Intel SGX v1 AMD SEV v1.0 Intel SGX v2 ARM TrustZone TPM 2.0 ARM TrustZone-M RISC-V Keystone Intel TDX 2003 2005 2014 2015 2016 2017 2018 2019 2020 Intel MKTME (Multi Key Total Memory Encryption) AMD SEV (Secure Encrypted Virtualization) Intel TDX (Trust Domain Extensions) AMD SEV-SNP (Secure Encrypted Virtualization – Secure Nested Paging) Intel SGX (Software Guard Extensions) | Ilhan Gurel | 2020-11-30 | Open | Page 5 of 19 The use cases Password Protection of protection AI/ML Communication Internet of Things protection Application and VM Blockchain protection Secure containers License management Privacy preserving analytics and Encrypted workloads databases Secure Attestation bootstrapping of identities Protection of Confidential Computing Secure Crypto and Key packet Management use cases processing operations | Ilhan Gurel | 2020-11-30 | Open | Page 6 of 19 The relevant open source projects ●Intel SGX SDK ●Apache Teaclave ●provided by Intel for developing Intel SGX secure ●Crypto API Toolkit (Intel SGX based softHSM) enclaves ●Baidu Rust SGX SDK ●provides libraries, headers, samples codes, tools ●Fortanix Rust SGX SDK and documentation ●Enarx ●Open Enclave SDK ●RISC-V Keystone ●open source SDK that mostly hides underlying enclave technology and initiated by Microsoft ●RISC-V HexFive ●Google Asylo ●Hyperledger Private Data Objects (Blockchain by Intel) ●open source SDK that mostly hides underlying enclave technology and initiated by Google ●The Confidential Consortium (CoCo) Framework (Blockchain by Microsoft) ●Google Project Oak: Control and end to end encryption of data in distributed systems ●Hyperledger Fabric Private Chaincode (Blockchain by IBM) | Ilhan Gurel | 2020-11-30 | Open | Page 7 of 19 What else is happening? ●The Confidential Computing Consortium ●Growing number startup companies emerging ●Announced on August 21st, 2019 by the and providing services/products related to Linux Foundation Confidential Computing ●An industry wide effort ●Commercial availability of “Confidential Computing” capabilities by the cloud vendors ●to advance computational trust and security for next-generation computing ●Lots of academic research on ●to bring together HW and SW vendors, ●finding novel solutions utilizing Confidential cloud providers, developers, open source Computing Technologies experts and academics to accelerate the ●microarchitectural side channel attacks and confidential computing market mitigations ●to influence the relevant technical and ●some interesting projects such as Slalom, regulatory standards Project Graviton and CoSMIX | Ilhan Gurel | 2020-11-30 | Open | Page 8 of 19 The solutions for encrypting applications, containers and VMs OCI encrypted Intel SGX Protected VMware vSphere VM Enarx container images Code Launch (PCL) encryption • Allows encryption • An application • PCL allows running • VMware vSphere VM container later deployment framework encrypted code and data encryption allows encryption of VM • Encryption can be • Support both AMD • “sgx_encrypt” tool images and VM disk done by using SEV an Intel SGX. encrypts the sections of images Containerd imgcrypt Intel TDX to follow a secure enclave library or skopeo tool (except .bss, .tbss, • Integration with • In case of AMD SEV, .dynamic, .debug,..) by vCenter Server and • Also see OCIcrypt and Enarx allows using AES GCM KMS the specification deployment of proposal. The work encrypted workloads • Content key is also includes to AMD SEV after provisioned y using a Kubernetes integration attestation and key sealing enclave IP provisioning processes enclave by using sgx_create_encrypt ed_enclave() | Ilhan Gurel | 2020-11-30 | Open | Page 9 of 19 What about Homomorphic Encryption? ●Homomorphic Encryption (HE) refers to an encryption scheme “that allows computation to be directly on encrypted data, without requiring any decryption in the process” ●Invented in 2009 ●but the origins go back to a paper (titled as “On Data Banks and Privacy Homomorphisms”) published by Ronald Linn Rivest and Len Adleman in 1978 ●(Ronald L. Rivest invented RSA algorithm together with Adi Shamir and Len Adleman in 1977) ●the existence of a Full HE scheme was demonstrated in 2009 by Craig Gentry ●Publicly available SW implementations are available: Microsoft SEAL , HELib (IBM) and PALISADE ●FHE is far from being practical due to massive overhead in computation and memory | Ilhan Gurel | 2020-11-30 | Open | Page 10 of 19 Attestation is a process of measuring code and data; and reporting these measurements as digitally signed to a requesting entity, which can evaluate these measurements further according to known values or whitelists. | Ilhan Gurel | 2020-11-30 | Open | Page 11 of 19 What is needed for a fully functional attestation mechanism ? Relying HW RoT Attester Protocol Verifier Party HW RoT for SW APIs for An attestation Being able to Relies on storage, reporting accessing crypto protocol between validate, verify attestation and measurement modules/the attestor and and evaluate verification results secure enclaves verifier attestation reports provided by the Crypto functionality Verifier functionality Efficient and Technical Attestation agent scalable protocol capabilities for Cryptographic and the relevant that can mitigate updating Applies specific identities for services known attacks whitelists, etc. actions based on attestation (e.g. replay attestation attacks) Keeping whitelists results up to date | Ilhan Gurel | 2020-11-30 | Open | Page 12 of 19 IETF RATS (Remote ATtestation procedureS) architectural overview Appraisal Policy Appraisal Policy for Evidence: for Evidence A set of rules that informs how a Verifier evaluates the validity of information about an Attester Attester An entity providing evidence that must be appraised in order to infer the extent to which the Attester is considered trustworthy Endorser An entity (typically a manufacturer) whose Endorsements help Verifiers appraise the authenticity of Evidence Evidence A set of information (digitally signed) about an Attester that is to be appraised by a Verifier Relying Party A role performed by an entity that depends on the validity of information about an Attester, for purposes of reliably applying application specific actions Relying Party An entity (typically an administrator), that is authorized to configure Owner Appraisal Policy for Attestation Results in a Relying Party Verifier A role performed by an entity that appraises the validity of Evidence about an Attester and produces Attestation Results to be used by a Relying Party https://datatracker.ietf.org/doc/draft-ietf-rats-architecture/ | Ilhan Gurel | 2020-11-30 | Open | Page 13 of 19 Intel SGX DCAP overview DCAP Provider Library Relying party/Verifier Platform PCS User Space Registration Service PCCS Application AESM Provisioning Certification Untrusted Caching Service ECDSA Quoting enclave TLS TLS Service Secure enclave Provisioning enclave /dev/sgx Kernel AESM Application Enclave Service Manager DCAP Data Center Attestation Primitives Intel SGX Driver Operated by non-Intel PCCS Provisioning Certificate Caching Server entities PCE Provisioning Certification PCK Provisioning Certification Key Operated by Intel PPID Platform Provisioning ID Reporting root key PCS Provisioning Certification Service Intel SGX capable CPU PSW Platform SW Seal root key QPL Quote Provider Library QGL Quote Generation Library QvE Quote Verification Enclave | Ilhan Gurel | 2020-11-30 | Open | Page 14 of 19 Intel SGX DCAP attestation data ●Attestation report body includes the following ●Intel SGX DCAP attestation quote. (see information (see sgx_report_body_t) sgx_quote3_t) | Ilhan Gurel | 2020-11-30 | Open | Page 15 of 19 Demo: PyTorch running in a secure enclave with encrypted input and output files Platform 1. Attest Key Provisioning Server 3. Validate attestation response Secure Enclave data provided by Intel Trusted Services Graphene-SGX 4. Provision decryption key Pretrained data (encrypted) PyTorch Image file Operated
Recommended publications
  • Efficiently Mitigating Transient Execution Attacks Using the Unmapped Speculation Contract Jonathan Behrens, Anton Cao, Cel Skeggs, Adam Belay, M
    Efficiently Mitigating Transient Execution Attacks using the Unmapped Speculation Contract Jonathan Behrens, Anton Cao, Cel Skeggs, Adam Belay, M. Frans Kaashoek, and Nickolai Zeldovich, MIT CSAIL https://www.usenix.org/conference/osdi20/presentation/behrens This paper is included in the Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation November 4–6, 2020 978-1-939133-19-9 Open access to the Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation is sponsored by USENIX Efficiently Mitigating Transient Execution Attacks using the Unmapped Speculation Contract Jonathan Behrens, Anton Cao, Cel Skeggs, Adam Belay, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL Abstract designers have implemented a range of mitigations to defeat transient execution attacks, including state flushing, selectively Today’s kernels pay a performance penalty for mitigations— preventing speculative execution, and removing observation such as KPTI, retpoline, return stack stuffing, speculation channels [5]. These mitigations impose performance over- barriers—to protect against transient execution side-channel heads (see §2): some of the mitigations must be applied at attacks such as Meltdown [21] and Spectre [16]. each privilege mode transition (e.g., system call entry and exit), To address this performance penalty, this paper articulates and some must be applied to all running code (e.g., retpolines the unmapped speculation contract, an observation that mem- for all indirect jumps). In some cases, they are so expensive ory that isn’t mapped in a page table cannot be leaked through that OS vendors have decided to leave them disabled by de- transient execution. To demonstrate the value of this contract, fault [2, 22].
    [Show full text]
  • Class-Action Lawsuit
    Case 3:20-cv-00863-SI Document 1 Filed 05/29/20 Page 1 of 279 Steve D. Larson, OSB No. 863540 Email: [email protected] Jennifer S. Wagner, OSB No. 024470 Email: [email protected] STOLL STOLL BERNE LOKTING & SHLACHTER P.C. 209 SW Oak Street, Suite 500 Portland, Oregon 97204 Telephone: (503) 227-1600 Attorneys for Plaintiffs [Additional Counsel Listed on Signature Page.] UNITED STATES DISTRICT COURT DISTRICT OF OREGON PORTLAND DIVISION BLUE PEAK HOSTING, LLC, PAMELA Case No. GREEN, TITI RICAFORT, MARGARITE SIMPSON, and MICHAEL NELSON, on behalf of CLASS ACTION ALLEGATION themselves and all others similarly situated, COMPLAINT Plaintiffs, DEMAND FOR JURY TRIAL v. INTEL CORPORATION, a Delaware corporation, Defendant. CLASS ACTION ALLEGATION COMPLAINT Case 3:20-cv-00863-SI Document 1 Filed 05/29/20 Page 2 of 279 Plaintiffs Blue Peak Hosting, LLC, Pamela Green, Titi Ricafort, Margarite Sampson, and Michael Nelson, individually and on behalf of the members of the Class defined below, allege the following against Defendant Intel Corporation (“Intel” or “the Company”), based upon personal knowledge with respect to themselves and on information and belief derived from, among other things, the investigation of counsel and review of public documents as to all other matters. INTRODUCTION 1. Despite Intel’s intentional concealment of specific design choices that it long knew rendered its central processing units (“CPUs” or “processors”) unsecure, it was only in January 2018 that it was first revealed to the public that Intel’s CPUs have significant security vulnerabilities that gave unauthorized program instructions access to protected data. 2. A CPU is the “brain” in every computer and mobile device and processes all of the essential applications, including the handling of confidential information such as passwords and encryption keys.
    [Show full text]
  • LVI-LFB: Scenarios 3 & 4
    WHITEPAPER Security Load Value Injection in the Line Fill Buffers: How to Hijack Control Flow without Spectre www.bitdefender.com Contents Abstract .............................................................................................................................3 Introduction .......................................................................................................................3 Recap – Meltdown, Spectre & MDS .................................................................................4 Meltdown .................................................................................................................................4 Spectre ..................................................................................................................................... 4 Microarchitectural Data Sampling .......................................................................................... 5 Load Value Injection in the Line Fill Buffers ....................................................................5 Exploiting LVI-LFB: scenarios 3 & 4..................................................................................7 Real-life exploit ..................................................................................................................7 Mitigations .........................................................................................................................8 Conclusions .......................................................................................................................9
    [Show full text]
  • Software-Based Power Side-Channel Attacks on X86
    PLATYPUS: Software-based Power Side-Channel Attacks on x86 Moritz Lipp∗, Andreas Kogler∗, David Oswald†, Michael Schwarz‡, Catherine Easdon∗, Claudio Canella∗, and Daniel Gruss∗ ∗ Graz University of Technology †University of Birmingham, UK ‡CISPA Helmholtz Center for Information Security Abstract—Power side-channel attacks exploit variations in on an ARM TrustZone-M platform using an onboard ADC, power consumption to extract secrets from a device, e.g., crypto- and Mantel et al. [56] distinguished different RSA keys by graphic keys. Prior attacks typically required physical access to measuring the power consumption on Intel desktop machines. the target device and specialized equipment such as probes and a high-resolution oscilloscope. The experimental results of Mantel et al. on RSA demonstrated In this paper, we present PLATYPUS attacks, which are that certain multiply operations of the square-and-multiply novel software-based power side-channel attacks on Intel server, implementation can be detected, but no full key recovery was desktop, and laptop CPUs. We exploit unprivileged access to achieved. Similarly, Fusi [20] tried to recover RSA-16384 keys the Intel Running Average Power Limit (RAPL) interface that but concluded that the sampling rate of the interface is too low exposes values directly correlated with power consumption, forming a low-resolution side channel. to mount an attack. We show that with sufficient statistical evaluation, we can In this work, we present PLATYPUS1 attacks which are observe variations in power consumption, which distinguish novel software-based power side-channel attacks on Intel different instructions and different Hamming weights of operands servers, desktops, and laptops by abusing unprivileged access and memory loads.
    [Show full text]
  • Speculative Dereferencing: Reviving Foreshadow (Extended Version)
    Speculative Dereferencing: Reviving Foreshadow (Extended Version) Martin Schwarzl1, Thomas Schuster1, Michael Schwarz2, and Daniel Gruss1 1Graz University of Technology, Austria 2CISPA Helmholtz Center for Information Security, Germany Abstract. In this paper, we provide a systematic analysis of the root cause of the prefetching effect observed in previous works and show that its attribution to a prefetching mechanism is incorrect in all previous works, leading to incorrect conclusions and incomplete defenses. We show that the root cause is speculative dereferencing of user-space registers in the kernel. This new insight enables the first end-to-end Foreshadow (L1TF) exploit targeting non-L1 data, despite Foreshadow mitigations enabled, a novel technique to directly leak register values, and several side-channel attacks. While the L1TF effect is mitigated on the most re- cent Intel CPUs, all other attacks we present still work on all Intel CPUs and on CPUs by other vendors previously believed to be unaffected. 1 Introduction For security reasons, operating systems hide physical addresses from user pro- grams [34]. Hence, an attacker requiring this information has to leak it first, e.g., with the address-translation attack by Gruss et al. [17, §3.3 and §5]. It allows user programs to fetch arbitrary kernel addresses into the cache and thereby to resolve virtual to physical addresses. As a mitigation against e.g., the address- translation attack, Gruss et al. [17, 16] proposed the KAISER technique. Other attacks observed and exploited similar prefetching effects. Meltdown [41] practically leaks memory that is not in the L1 cache. Xiao et al. [72] show that this relies on a prefetching effect that fetches data from the L3 cache into the L1 cache.
    [Show full text]
  • SPECBOX: a Label-Based Transparent Speculation Scheme Against Transient Execution Attacks
    SPECBOX: A Label-Based Transparent Speculation Scheme Against Transient Execution Attacks Bowen Tang1;2 , Chenggang Wu1;2, Zhe Wang1;2, Lichen Jia1;2, Pen-Chung Yew3, Yueqiang Cheng4, Yinqian Zhang5, Chenxi Wang6, Guoqing Harry Xu6 1State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, 2University of the Chinese Academy of Sciences, 3University of Minnesota at Twin Cities, 4NIO Security Research, 5Southern University of Science and Technology, 6University of California, Los Angeles 1{tangbowen, wucg, wangzhe12, jialichen}@ict.ac.cn, [email protected], [email protected], [email protected], 6{wangchenxi, harryxu}@cs.ucla.edu Abstract—Speculative execution techniques have been a cor- when the processor determines that it is a mis-prediction in nerstone of modern processors to improve instruction-level Line 5, it will squash the instructions of Lines 6-7 and follow parallelism. However, recent studies showed that this kind of the correct path. In the current design, the processor will not techniques could be exploited by attackers to leak secret data via transient execution attacks, such as Spectre. Many defenses clean up the side effects in the cache (i.e. the data brought in are proposed to address this problem, but they all face various during the mis-speculative execution). The attacker can scan challenges: (1) Tracking data flow in the instruction pipeline the dummy array in the cache, and measure the access time could comprehensively address this problem, but it could cause of each array element. According to the access latency, the pipeline stalls and incur high performance overhead; (2) Making attacker can decide which item has been loaded into the cache, side effect of speculative execution imperceptible to attackers, but it often needs additional storage components and complicated and thereby infer the secret value.
    [Show full text]
  • Efficiently Mitigating Transient Execution Attacks Using the Unmapped Speculation Contract Jonathan Behrens, Anton Cao, Cel Skeggs, Adam Belay, M
    Efficiently Mitigating Transient Execution Attacks using the Unmapped Speculation Contract Jonathan Behrens, Anton Cao, Cel Skeggs, Adam Belay, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL Abstract designers have implemented a range of mitigations to defeat transient execution attacks, including state flushing, selectively Today’s kernels pay a performance penalty for mitigations— preventing speculative execution, and removing observation such as KPTI, retpoline, return stack stuffing, speculation channels [5]. These mitigations impose performance over- barriers—to protect against transient execution side-channel heads (see §2): some of the mitigations must be applied at attacks such as Meltdown [21] and Spectre [16]. each privilege mode transition (e.g., system call entry and exit), To address this performance penalty, this paper articulates and some must be applied to all running code (e.g., retpolines the unmapped speculation contract, an observation that mem- for all indirect jumps). In some cases, they are so expensive ory that isn’t mapped in a page table cannot be leaked through that OS vendors have decided to leave them disabled by de- transient execution. To demonstrate the value of this contract, fault [2, 22]. Recent processor designs have also incorporated the paper presents WARD, a new kernel design that maintains mitigations into hardware, which also reduces performance a separate kernel page table for every process. This page table compared to earlier processor designs that do not perform such contains mappings for kernel memory that is safe to expose hardware mitigations. to that process. Because a process doesn’t map data of other To address the above challenge, this paper proposes a new processes, this design allows for many system calls to execute hardware/software contract, called the unmapped speculation without any mitigation overhead.
    [Show full text]
  • A Systematic Analysis of Machine Clears and Their Implications For
    Rage Against the Machine Clear: A Systematic Analysis of Machine Clears and Their Implications for Transient Execution Attacks Hany Ragab, Enrico Barberis, Herbert Bos, and Cristiano Giuffrida, Vrije Universiteit Amsterdam https://www.usenix.org/conference/usenixsecurity21/presentation/ragab This paper is included in the Proceedings of the 30th USENIX Security Symposium. August 11–13, 2021 978-1-939133-24-3 Open access to the Proceedings of the 30th USENIX Security Symposium is sponsored by USENIX. Rage Against the Machine Clear: A Systematic Analysis of Machine Clears and Their Implications for Transient Execution Attacks Hany Ragab∗ Enrico Barberis∗ Herbert Bos Cristiano Giuffrida [email protected] [email protected] [email protected] [email protected] Vrije Universiteit Amsterdam Amsterdam, The Netherlands ∗Equal contribution joint first authors Abstract 79, 82]. Building mostly on well-known causes of transient execution, such as branch mispredictions or aborting Intel Since the discovery of the Spectre and Meltdown vulnera- TSX transactions, such variants violate many security bound- bilities, transient execution attacks have increasingly gained aries, allowing attackers to obtain access to unauthorized data, momentum. However, while the community has investigated divert control flow, or inject values in transiently executed several variants to trigger attacks during transient execution, code. Nonetheless, little effort has been made to systemat- much less attention has been devoted to the analysis of the ically investigate the root causes of what Intel refers to as root causes of transient execution itself. Most attack vari- bad speculation [36]—the conditions that cause the CPU to ants simply build on well-known root causes, such as branch discard already issued micro-operations (µOps) and render misprediction and aborts of Intel TSX—which are no longer them transient.
    [Show full text]
  • LVI Hijacking Transient Execution with Load Value Injection
    LVI Hijacking Transient Execution with Load Value Injection Daniel Gruss, Daniel Moghimi, Jo Van Bulck Hardwear.io Virtual Con, April 30, 2020 1 Daniel Gruss, Daniel Moghimi, Jo Van Bulck National Geographic Processor security: Hardware isolation mechanisms App App App Enclave VM OS VM OS Hypervisor (VMM) 3 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache printf("%d", i); printf("%d", i); 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache Cache miss printf("%d", i); printf("%d", i); 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache Request Cache miss printf("%d", i); printf("%d", i); 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache Request Cache miss printf("%d", i); i printf("%d", i); Response 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache Request Cache miss printf("%d", i); i printf("%d", i); Response Cache hit 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck CPU Cache DRAM access, slow Request Cache miss printf("%d", i); i printf("%d", i); Response Cache hit No DRAM access, much faster 4 Daniel Gruss, Daniel Moghimi, Jo Van Bulck Flush+Reload Shared Memory ATTACKER VICTIM flush access access 5 Daniel Gruss, Daniel Moghimi, Jo Van Bulck Flush+Reload Shared Memory ATTACKER VICTIM flush cached Shared Memory access access cached 5 Daniel Gruss, Daniel Moghimi, Jo Van Bulck Flush+Reload Shared Memory ATTACKER VICTIM flush Shared Memory access access 5 Daniel Gruss, Daniel Moghimi, Jo Van Bulck Flush+Reload Shared Memory ATTACKER VICTIM flush access access 5 Daniel Gruss, Daniel Moghimi, Jo Van Bulck Flush+Reload Shared
    [Show full text]
  • The Evolution of Transient-Execution Attacks Claudio Canella Khaled N
    The Evolution of Transient-Execution Attacks Claudio Canella Khaled N. Khasawneh Daniel Gruss Graz University of Technology George Mason University Graz University of Technology [email protected] [email protected] [email protected] ABSTRACT From a security perspective, non-architectural state was long Historically, non-architectural state was considered non-observable. considered non-observable as there is no attacker-accessible inter- Side-channel attacks, in particular on caches, already showed that face to check what is in the cache. Kocher [23] brought up the idea this is not entirely correct and meta-information, such as the cache that caches could be used in side-channel attacks. Such attacks mea- state, can be extracted. Transient-execution attacks emerged when sure the latency of memory accesses to infer what is in the cache, multiple groups discovered the exploitability of speculative execu- yielding an interface that makes non-architectural state visible to tion and, simultaneously, the exploitability of deferred permission an attacker. However, the information extracted here is only meta- checks in modern out-of-order processors. These attacks are called information, i.e., whether the data was retrieved from the cache or transient as they exploit that the processor first executes operations main memory. While this enables powerful cryptographic [28] and that are then reverted as if they were never executed. However, on non-cryptographic [12] attacks, both the security community and the microarchitectural level, these operations and their effects can the architecture community deemed it most reasonable to design be observed. While side-channel attacks enable and exploit direct ac- code in a way such that secrets do not influence meta-information, cess to meta-data from other security domains, transient-execution e.g., no secret-dependent memory accesses [3].
    [Show full text]
  • Transient-Execution Attacks and Defenses
    Transient-Execution Attacks and Defenses Habilitation by Daniel Gruss June 2020 Daniel Gruss Transient-Execution Attacks and Defenses (Part I only) Habilitation June 2020 Institute for Applied Information Processing and Communications Graz University of Technology SCIENCE PASSION TECHNOLOGY Abstract The complexity of modern computer systems has dramatically increased over the past decades and continues to increase. The common solution to construct such complex systems is the divide-and-conquer strategy, dividing a complex system into smaller and less complex systems or system components. For a small system component, the complexity of the full system is hidden behind abstraction layers, allowing to develop, improve, and reason about it. As computers have become ubiquitous, so has computer security, which is now present in all aspects of our lives. One fundamental problem of security stems from the strategy that allowed building and maintaining complex systems: the isolated view of system components. Security problems often arise when abstractions are imperfect or incomplete, which they inherently need to be to hide complexity. In this habilitation, we focus on a very specific type of computer security problem, where an imperfect abstraction of the hardware can be observed from the software layer. The abstraction of the hardware, i.e., the defined hardware interface, is often called the \architecture". In contrast, the concrete implementation of the hardware interface, is called the \microar- chitecture". Architecture and microarchitecture often deviate enough to introduce software-exploitable behavior. This entirely new field of research, called \Transient-Execution Attacks", has not existed before our seminal works in 2018. Transient-execution attacks exploit that the hardware transiently performs operations it should not perform, in one of two cases: In one case deliberately (non-speculatively), as the operations will be architecturally discarded anyway.
    [Show full text]
  • Rage Against the Machine Clear: a Systematic Analysis of Machine Clears and Their Implications for Transient Execution Attacks
    Rage Against the Machine Clear: A Systematic Analysis of Machine Clears and Their Implications for Transient Execution Attacks Hany Ragab∗ Enrico Barberis∗ Herbert Bos Cristiano Giuffrida [email protected] [email protected] [email protected] [email protected] Vrije Universiteit Amsterdam Amsterdam, The Netherlands ∗Equal contribution joint first authors Abstract 80, 83]. Building mostly on well-known causes of transient execution, such as branch mispredictions or aborting Intel Since the discovery of the Spectre and Meltdown vulnera- TSX transactions, such variants violate many security bound- bilities, transient execution attacks have increasingly gained aries, allowing attackers to obtain access to unauthorized data, momentum. However, while the community has investigated divert control flow, or inject values in transiently executed several variants to trigger attacks during transient execution, code. Nonetheless, little effort has been made to systemat- much less attention has been devoted to the analysis of the ically investigate the root causes of what Intel refers to as root causes of transient execution itself. Most attack vari- bad speculation [36]—the conditions that cause the CPU to ants simply build on well-known root causes, such as branch discard already issued micro-operations (µOps) and render misprediction and aborts of Intel TSX—which are no longer them transient. As a result, our understanding of these root supported on many recent processors. causes, as well as their security implications, is still limited. In this paper, we tackle the problem from a new perspective, In this paper, we systematically examine such causes with a closely examining the different root causes of transient exe- focus on a major, largely unexplored class of bad speculation.
    [Show full text]