Cachezoom: How SGX Amplifies the Power of Cache Attacks

CacheZoom: How SGX Ampliﬁes The Power of Cache Attacks

Ahmad Moghimi Gorka Irazoqui Worcester Polytechnic Institute Worcester Polytechnic Institute [email protected] [email protected] Thomas Eisenbarth Worcester Polytechnic Institute [email protected]

Abstract the operating system (OS) provides security and privacy services. In cloud computing, cloud providers and the In modern computing environments, hardware resources hypervisor also become part of the Trusted Computing are commonly shared, and parallel computation is widely Base (TCB). Due to the high complexity and various at- used. Parallel tasks can cause privacy and security prob- tack surfaces in modern computing systems, keeping an lems if proper isolation is not enforced. Intel proposed entire system secure is usually unrealistic [19, 33]. SGX to create a trusted execution environment within the processor. SGX relies on the hardware, and claims run- One way to reduce the TCB is to outsource security- time protection even if the OS and other software com- critical services to Secure Elements (SE), a separate ponents are malicious. However, SGX disregards side- trusted hardware which usually undergoes rigorous au- channel attacks. We introduce a powerful cache side- diting. Trusted Platform Modules (TPM), for example, channel attack that provides system adversaries a high provide services such as cryptography, secure boot, seal- resolution channel. Our attack tool named CacheZoom ing data and attestation beyond the authority of the OS is able to virtually track all memory accesses of SGX en- [40]. However, SEs come with their own drawbacks: claves with high spatial and temporal precision. As proof they are static components and connected to the CPU of concept, we demonstrate AES key recovery attacks over an untrusted bus. Trusted Execution Environments on commonly used implementations including those that (TEE) are an alternative, which provide similar services were believed to be resistant in previous scenarios. Our within the CPU. A TEE is an isolated environment to results show that SGX cannot protect critical data sen- run software with a higher trust level than the OS. The sitive computations, and efficient AES key recovery is software running inside a TEE has full access to the sys- possible in a practical environment. In contrast to pre- tem resources while it is protected from other applica- vious works which require hundreds of measurements, tions and the OS. Examples include ARM TrustZone [4] this is the first cache side-channel attack on a real sys- and Intel Software Guard eXtensions (SGX) [29]. Intel tem that can recover AES keys with a minimal number SGX creates a TEE on an untrusted system by only trust- of measurements. We can successfully recover AES keys ing the hardware in which the code is executed. Trusted from T-Table based implementations with as few as ten code is secured in an enclave, which is encrypted and au- arXiv:1703.06986v2 [cs.CR] 20 Aug 2017 measurements.1 thenticated by the hardware. The CPU decrypts and ver- ifies enclave code and data as it is moved into the cache. That is, enclaves are logically protected from malicious 1 Motivation applications, the OS, and physical adversaries monitor- ing system buses. However, Intel SGX is not protected In the parallel computing environment, processes with against attacks that utilize hardware resources as a side various trust and criticality levels are allowed to run con- channel [28]. And indeed, first proposed works showing currently and share system resources. Proliferation of that microarchitectural side channels can be exploited in- cloud computing technology elevated these phenomena clude attacks using page table faults [53] and the branch to the next level. Cloud computers running many dif- prediction unit [34]. ferent services authored by various providers process Caches have become a very popular side channel in user information on the same hardware. Traditionally, many scenarios, including mobile [35] and cloud envi- 1 Publication This work is accepted at the Conference on Crypto- ronments [26]. Reasons include that Last Level Cache graphic Hardware and Embedded Systems (CHES 2017) [39]. (LCC) attacks perform well in cross-core scenarios on Intel machines. Another advantage of cache attacks are • Shows that some of the countermeasures that were the high spatial resolution they provide. This high spa- supposed to protect AES implementations, e.g. tial resolution, combined with a good temporal reso- prefetching and S-box implementations, are not ef- lution, have enabled attacks on major asymmetric im- fective in the context of SGX. In fact, prefetching plementations, unless they are optimized for constant can even ease the retrieval of memory traces. memory accesses. For symmetric cryptography, the scenario is more challenging. A software AES implementation can be executed in a few hundred cycles, while a 2 Background Prime+Probe cycle on the LLC takes about 2000 cycles to monitor a single set. To avoid the undersampling, syn- This section covers topics that help understand the side chronized attacks first prime, trigger a single encryption channel used to retrieve sensitive information. We dis- and then probe, yielding at best one observation per en- cuss the basic functionality of Intel SGX and possible cryption [37]. Higher resolution is only possible in OS microarchitectural attacks that can be deployed against adversarial scenarios. it.

1.1 Our Contribution 2.1 How Intel SGX Works We demonstrate not only that Intel SGX is vulnerable to cache attacks, but show that with SGX, the quality of Intel introduced SGX, a new subset of hardware instruc- information retrieved is significantly improved. The im- tions that allows execution of software inside isolated proved resolution enables attacks that are infeasible in environments called enclaves with the release of Sky- previous scenarios, e.g., cloud environments. We utilize lake generation. Enclaves are isolated from other com- all the capabilities that SGX assumes an attacker has, i.e., ponents running on the same hardware, including OSs. 2 full access to OS resources. We construct a tool named SGX has recently gained attention of the security com- CacheZoom that is able to interrupt the victim every few munity and various SGX-based solutions have been pro- memory accesses, thereby collecting high-resolution in- posed [5, 7, 45]. formation about all memory accesses that the target en- Enclave modules can be shipped as part of an un- clave makes by applying Prime+Probe attack in the L1 trusted application and can be utilized by untrusted com- cache. The usage of core-private resources does not re- ponents of the application. The untrusted component in- duce the applicability of the attack, as the compromised teracts with the system software, which dedicates spe- OS schedules both victim and attacker in the same core. cific trusted memory regions for the enclave. After that, While tracking memory accesses of enclave with high the authenticity, integrity and confidentiality of enclave temporal and spatial resolution has many adversarial sce- are provided and measured by the hardware. Any un- narios, we demonstrate the power of this side channel trusted code base, including the OS, has no control over by attacking several AES implementations. Further, we the trusted memory region. Untrusted applications can show that adopted countermeasures in popular crypto- only use specific instructions to call the trusted compo- graphic libraries, like cache prefetching and implemen- nent through predefined interfaces. This design helps de- tations with small memory footprint, not only do not pre- velopers to benefit from the hardware isolation for secu- vent attacks, but can facilitate attacker’s observation. In rity critical applications. short, this work: SGX is designed to protect enclaves from malicious • Presents a powerful and low-noise side channel im- users that gain root access to an OS. Memory pages be- plemented through the L1 cache. We exploit several longing to an enclave are encrypted in DRAM and pro- capabilities corresponding to the compromised OS. tected from a malicious OS snooping on them. Pages This side channel can be applied against TEEs to are only decrypted when they are processed by the CPU, recover fine grained information about memory ac- e.g., when they are moved to the caches. In short, SGX cesses, which often carry sensitive data. assumes only the hardware to be trusted; any other agent is considered susceptible of being malicious. Upon en- • Demonstrates the strength of our side channel by clave creation, virtual memory pages that can only map recovering AES keys with fewer traces than ever to a protected DRAM region (called the Enclave Page in previous attacks, and further, by attacking im- Cache) are reserved. The OS is in charge of the mem- plementations considered resistant against cache at- ory page mapping; however, SGX detects any malicious tacks. mapping performed by it. In fact, any malicious action 2CacheZoom source and data sets: https://github.com/ from the OS will be stored by SGX and is verifiable by vernamlab/CacheZoom third party agents.

2 2.2 Microarchitectural Attacks in SGX and ElGamal keys across VMs [44, 56]. As our attack is carried out in the L1 caches, we do not face some hurdles Despite all the protection that SGX offers, the documen- (e.g. slices) that an attacker would have to overcome. tation specifically claims that side channel attacks were The Prime+Probe attack stages include: not considered under the threat scope of its design. In fact, although dealing with encrypted memory pages, • Prime: in which the attacker fills the entire cache the cache utilization is performed similar to decrypted or a small portion of it with her own dummy data. mode and concurrently to any other process in the sys- • Victim Access: in which the attacker waits for the tem. This means that the hardware resources can be uti- victim to make accesses to particular sets in the lized as side channels by both malicious enclaves and cache, hoping to see key dependent cache utiliza- OSs. While enclave-to-enclave attacks have several simi- tion. Note that, in any case, victim accesses to larities to cross-VM attacks, malicious OS-to-enclave at- primed sets will evict at least one of the attackers tacks can give attackers a new capability not observed dummy blocks from the set. before: virtually unlimited temporal resolution. The OS can interrupt the execution of enclave processes after ev- • Probe: in which the attacker performs a per-set ery small number of memory accesses to check the hard- timed re-access of the previously primed data. If ware utilization, as just the TLB (but no other hardware the attacker observes a high probe time, she deduces resources) is flushed during context switches. Further, that the cache set was utilized by the victim. On the while cross-core attacks gained huge popularity in others contrary, if the attacker observes low access times, scenarios for not requiring core co-residency, a compro- she deduces that all the previously primed memory mised OS can assign an enclave any affinity of its choice, blocks still reside in the cache, i.e., it was not uti- and therefore use any core-private resource. Thus, while lized by the victim. SGX can prevent untrusted software to perform Direct Thus, the Prime+Probe methodology allows an at- Memory Access (DMA) attacks, it also gives almost full tacker to guess the cache sets utilized by the victim. This resolution for exploitation by hardware side channels. information can be used to mount a full key recovery For instance, an attacker can exploit page faults to learn attack if the algorithm has key-dependent memory ac- about the memory page usage of the enclave. Further she cesses translated into different cache set accesses. can create contention and snoop on the utilization of any core-private and core-shared resource, including but not limited to Branch Prediction Units (BPUs), L1 caches or 3 Related Work LLCs [1, 36, 42]. Further, although applicable in other scenarios [10], enclave execution mode does not update Timing side-channel attacks have been studied for the Hardware Performance Counters, and these can not many years. On a local area network, the timing of the provide (at least directly) information about the isolated decryption operation on a web server could reveal infor- process. mation about private keys stored on the server [15]. Tim- ing attacks are capable of breaking important cryptog- From the aforementioned resources, cache gives the raphy primitives, such as exponentiation and factoriza- most information. Unlike page faults, which at most will tion operations of Diffie-Hellman and RSA [32]. More give a granularity of 4 kB, cache hits/misses can give specifically, microarchitectural timing side channels 64 byte utilization granularity. In addition, while other have been explored extensively [21]. The first attacks hardware resources like Branch Prediction Units (BPU) proposed were based on the timing difference between can only extract branch dependent execution flow infor- local core-private cache misses and hits. Generally, mation, cache attacks can extract information from any cache timing attacks are based on the fact that a spy memory access. Although most prior work targets the process can measure the differences in memory access LLC for being shared across cores, this is not necessary times. These attacks are proposed to recover cryptog- in SGX scenarios, local caches are as applicable as LLC raphy keys of ciphers such as DES [51], AES [11] attacks. Further, because caches are not flushed when the and RSA [43]. Although there exist solutions to make enclave execution is interrupted, the OS can gain almost cryptographic implementation resistant to cache attacks unlimited timing resolution. [13, 42], most of these solutions result in worse performance. Further, cache attacks are capable of extracting 2.3 The Prime+Probe Attack information from non-cryptographic applications [57]. More recent proposals applied cache side channels on The Prime+Probe attack was first introduced as a spy shared LLC, a shared resource among all the cores. This process capable of attacking core-private caches [42]. It is important as, compared to previous core-private at- was later expanded to recover RSA keys [2], keystrokes tacks, LLC attacks are applicable even when attacker and

3 victim reside in different cores. The Flush+Reload [8,54] 4 Creating a High-resolution Side Channel attack on LLC is only applicable to systems with shared on Intel SGX memory. These side channels can be improved by performance degradation [3, 24]. Flush+Reload can be ap- We explain how to establish a high resolution channel on plied across VMs [31], in Platform as a service (PaaS) a compromised OS to monitor an SGX enclave. We first clouds [57] and on smartphones [35]. The Flush+Reload describe attacker capabilities, then our main design goals is constrained by the memory deduplication requirement. and how our malicious kernel driver is implemented. We On the other hand, Prime+Probe [36], shows that in finally test the resolution of our proposed side channel. contrast to the previous core-private cache side channels and the Flush+Reload attack, practical attacks can be 4.1 Attacker Capabilities performed without memory deduplication or a core co- residency requirement. The Prime+Probe attack can be In our attack, we assume that the adversary has root ac- implemented from virtually any cloud virtual machines cess to a Linux OS running SGX. The attacker is capable running on the same hardware. The attacker can iden- of installing kernel modules and configuring boot prop- tify where a particular VM is located on the cloud in- erties of the machine. As consequence of root access, frastructure such as Amazon EC2, create VMs until a the attacker can read the content of static binary on the co-located one is found [44, 55] and perform cross-VM disk, observe which symmetric cipher and implementa- Prime+Probe attacks [30]. Prime+Probe can also be tion is used, and identify offset of tables that static data mounted from a browser using JavaScript [41] and as from the victim binary will occupy.3 Although the at- a malicious smartphone application [35]. In addition tacker can observe the binary, she has no knowledge of to caches, other microarchitectural components such as the cipher key used during the encryption. In addition, Branch Target Buffers (BTB) are vulnerable to side the attacker is capable of synchronizing the enclave ex- channels [1, 34]. BTB can be exploited to determine ecution with CacheZoom. These assumptions are rea- if a branch has been taken by a target process or not, sonable, as SGX promises a trusted environment for ex- e.g. to bypass Address Space Layout Randomization ecution on untrusted systems. Symmetric keys can be (ASLR) [20]. generated at runtime from a secure random entropy (using RDRAND instruction) and/or transferred through a Security of Intel SGX has been analyzed based on the public secure channel without the attacker knowledge. available public resources [17]. A side channel resistant TCB is proposed in the literature [18]. However, the pro- 4.2 CacheZoom Design posed solution requires significant changes to the design of the processor. Similar to Intel SGX, ARM TrustZone To create a high bandwidth channel with minimal noise, is vulnerable to cache side-channel attacks [35]. Control- (1) we need to isolate the attackers’ malicious spy pro- Channel attacks [53] have been proposed using the page- cess code and the target enclave’s trusted execution from fault mechanism. An adversarial OS can introduce page the rest of the running operations and (2) we need to per- faults to a target application and, based on the timing of form the attack on small units of execution. By having the accessed page, the execution flow of a target can be these two elements, even a comparably small cache like inferred at page size granularity. Page fault side channels L1 turns into a high capacity channel. Note that our are effective on SGX and can be defeated using software spy process monitors the L1D data cache, but can also solutions [49] or by exploiting Intel Transactional Syn- be implemented to monitor the L1I instruction cache or chronization Extensions (TSX) [48]. Race conditions LLC. Our spy process is designed to profile all the sets between two running threads inside an enclave can be in the L1D cache with the goal of retrieving maximum exploited [52]. SGX-Shield [47] proposes protection by leakage. In order to avoid noise, we dedicate one phys- adding ASLR protection and introduces software diver- ical core to our experimental setup, i.e., to the attacker sity inside an enclave. Several Cache attacks on SGX Prime+Probe code and the victim enclave process. All have recently and concurrently been shown, e.g. on other running operations on the system, including OS AES [22] and RSA [12]. While those works also exploit services and interrupts, run on the remaining cores. Fur- core co-location and L1 cache leakage, they fall short thermore, CacheZoom forces the enclave execution to be of exposing the full temporal and spatial resolution and interrupted in short time intervals, in order to identify thus focus on known vulnerable implementations and at- all enclave memory accesses. Note that, the longer the tack styles. An enclave-to-enclave attack through LLC in victim enclave runs without interruption, the higher the a different adversarial scenario [46], as well as methods 3If the enclave binary is obfuscated, position of tables needs to be to detect privileged side-channel attacks from within an reconstructed using reverse engineering methods, e.g. by analyzing enclave [16] have concurrently been proposed. cache access patterns [26].

4 number of accesses made to the cache, implying higher processor features can be disabled through the computer noise and less temporal resolution. CacheZoom should BIOS setup or can be conﬁgured by the OS to avoid un- further reduces other possible sources of noise, e.g., con- predictable behavior. In our attack, we simply disable ev- text switches. The main purpose is that the attacker can ery second logical processor to practically avoid hyper- retrieve most of the secret dependent memory accesses threading. To maintain a stable frequency in spite of the made by the target enclave. Since the L1 cache is virtu- available battery saving and frequency features, we set ally addressed, knowing the offset with respect to a page the CPU scaling governor to performance and limit the boundary is enough to know the accessed set. maximum and minimum frequency range.

4.3 CacheZoom Implementation 4.3.2 Increasing the time resolution We explain technical details behind the implementation Aiming at reducing the number of memory accesses of CacheZoom, in particular, how the noise sources are made by the victim between two malicious OS inter- limited and how we increase the time resolution to obtain rupts, we use the local APIC programmable interrupt, clean traces. available on phyisical cores. The APIC timer has different programmable modes but we are only interested in the TSC-Deadline mode. In TSC deadline mode, 4.3.1 Enclave-Attack Process Isolation the specified TSC value will cause the local APIC to generate a timer IRQ once the CPU reaches it. In the Linux OS schedules different tasks among available log- Linux kernel, the function lapic_next_deadline is ical processors by default. The main scheduler func- responsible for setting the next deadline on each inter- tion __schedule is triggered on every tick of the logi- rupt. The actual interrupt handler routine for this IRQ cal processor’s local timer interrupt. One way to remove is local_apic_timer_interrupt. In order to en- a specific logical processor from the default schedul- able/disable our attack, we install hooks on these two ing algorithm is through the kernel boot configuration functions. By patching the null function calls, available isolcpus which accepts a list of logical cores to be ex- for the purpose of live patching, we can redirect these cluded from scheduling. To avoid a logical core from functions to the malicious routines in our kernel modules triggering the scheduling algorithm on its local timer in- at runtime. terrupt, we can use nohz_full boot configuration option. Recall that reconfiguring the boot parameters and ffffffff81050900 lapic_next_deadline restarting the OS is included in our attackers capabili- ffffffff81050900: callq null_sub1 ties. However, these capabilities are not necessary, as we can walk through the kernel task tree structure and turn ffffffff81050c90 local_apic_timer_interrupt the PF_NO_SETAFFINITY flag off for all tasks. Then, by ffffffff81050c90: callq null_sub2 dynamically calling the kernel sched_setaffinity interface for every task, we are able to force all the running In the modified lapic_next_deadline function, we kernel and user tasks to execute on specific cores. In ad- set the timer interrupt to specific values such that the run- dition to tasks and kernel threads, interrupts also need to ning target enclave is interrupted every short period of be isolated from the target core. Most of the interrupts execution time. In the modified local_apic_timer_ can be restricted to specific cores except for the non- interrupt, we first probe the entire 64 sets of the L1D maskable interrupts (NMIs), which can’t be avoided. cache to gather information of the previous execution However, in our experience, their occurrence is negligi- unit and then prime the entire 64 sets for the next one. ble and does not add considerable amount of noise. After each probe, we store the retrieved cache informa- CPU frequency has a more dynamic behavior in mod- tion to a separate buffer. Our kernel driver is capable of ern processors. Our target processor has Speedstep tech- performing 50000 circular samplings. To avoid unnec- nology which allows dynamic adjustment of processor essarly sampling, we need to synchronize with the target voltage and C-state, which allows different power man- enclave execution. For this purpose, we enable the hooks agement states. These features, in addition to hyper- just before the call to the enclave interface and disable it threading (concurrent execution of two threads on the right after. same physical core), make the actual measurement of cycles through rdtsc less reliable. Cache side channel 4.4 Testing the Performance of attacks that use this cycle counter are affected by the dy- CacheZoom namic CPU frequency. In non-OS adversarial scenarios, these noise sources have been neglected thus forcing the Our experimental setup is a Dell Inspiron 5559 lap- attacker to do more measurements. In our scenario, these top with Intel(R) Skylake Core(TM) i7-6500U processor

5 100 are only 4 sets that get ﬁlled as a side effect of the context 90 switch memory accesses. For the other sets, we observed 80 either 0 or less than 8 unwanted accesses. Due to the 70 consistency of the number of evictions per set, we can

Cycle 60 50 conclude that only sets that get completely filled are ob- 40 scure and do not leak any information, 4 out of 64 sets in 30 our particular case. An example of the applied noise ex- 0 1 2 3 4 5 6 7 8 Number of Eviction filtration process can be observed in Figure 3, in which the enclave process was consecutively accessing differ- Figure 1: Average cycle count per number of evictions in ent sets. The left hand figure shows the hit access map, a set. without taking into account the appropriate set threshold. The right hand figure shows the access pattern retrieved 100 Eviction from the enclave once the context switch noise access Limit 90 has been taking into account and removed.

80 70 5 Attack on AES 60 Cycle Count 50 The following gives a detailed description of different 40 0 10 20 30 40 50 60 implementation styles for AES to help the reader under- Set Number stand the attacks that we later perform: Figure 2: Average cycle count for each set. Variations are due to channel noise: 4 sets are unusable for attacks. 5.1 Cache Attacks on Different AES Im- plementations running Ubuntu 14.04.5 LTS and SGX SDK 1.7. Our tar- AES is a widely used block cipher that supports three get processor has 2 hyper-threaded physical cores. Each key sizes from 128 bit to 256 bits. Our description physical core has 32 kB of L1D and 32 kB of L1I local and attacks focus on the 128-bit key version, AES-128, cache memory. The L1 cache, used as our side channel, but most attacks described can be applied to larger-key is 8 way associative and consists of 64 sets. versions as well. AES is based on 4 main operations: Even though Skylake processors use an adaptive LRU AddRoundKey, SubBytes, ShiftRows and MixColumns. cache replacement policy and the adaptive behavior is The main source of leakage in AES comes from the state- undocumented [23], our results show that we can still dependent table look ups for the SubBytes operation. use the pointer chasing eviction set technique [36] to de- These look-ups result in secret-dependent memory ac- tect memory accesses. In the specific case of our L1D cesses, which can be exploited by cache attacks. cache, the access time for chasing 8 pointers associated S-box: Software implementations that implement the 4 to a specific set is about 40 cycles on average. In order to stages independently base the SubBytes operation test the resolution of our side channel, we took an aver- in a 256 entry substitution table, each entry being 8 age of 50000 samples of all the sets and varied the num- bits long. In this implementation, a total of a 160 ac- ber of evictions from 0 to 8. The results can be seen in cesses are performed to the S-box during a 128-bit Figure 1, where the access time is increased by roughly AES encryption, 16 accesses per round. We refer to 5 cycles for every additional eviction. Thus, our results this implementation style as the S-box implementa- show that our eviction set gives us an accurate measure- tion. ment on the number of evicted lines from a specific set. Our isolated CPU core and the L1D eviction set have 4 T-tables: To achieve a better performance, some im- the minimal possible noise and avoid noises such as CPU plementations combine the MixColumns and Sub- frequency, OS and enclave noise; however, the actual Bytes in a single table lookup. At the cost of bigger noise from the context switch between enclave process pre-computed tables (and therefore, more memory and attacker interrupt is mostly unavoidable. The amount usage) the encryption time can be significantly re- of noise that these unwanted memory accesses add to the duced. The most common type uses 4 T-tables: 256 observation can be measured by running an enclave with entry substitution tables, each entry being 32 bits an empty loop under our attack measurement. Our re- long. The entries of the four T-tables are the same sults, presented in Figure 2, show that every set has a bytes but rotated by 1, 2 and 3 positions, depend- consistent number of evictions. Among the 64 sets, there ing on the position of the input byte in the column

6 Figure 3: Cache hit map before (left) and after (right) ﬁltering for context switch noise. Enclave memory access patterns are clearly visible once standard noise from context switch has been eliminated

0 of the AES state. We refer to this style as T-table to byte i and si is the intermediate state before the Mix- implementation. We refer to this as the 4 T-table Columns operation in the first round. We see that, if the implementation. attacker knows the table entry being utilized xi and the 0 plaintext he can derive equations in the form xi=pi ⊕ ki Large T-table Aiming at improving the memory usage to recover the key. A similar approach can be utilized to of T-table based implementations, some designs uti- mount an attack in the last round where the output is in lize a single 256 entries T-table, where each entry is 9 10 the form ci = Ti[si ] ⊕ ki . The maximum an attacker can 64 bits long. Each entry contains two copies of the learn, however, is 4 bit per lookup, if each lookup can be 32 bit values typically observed with regular size observed separately. The scenario for attacks looking at T-tables. This design reads each entry with a dif- accesses to a single cache line for an entire encryption ferent byte offset, such that the values from the 4 learn a lot less, hence need significantly more measure- T-tables can be read from a single bigger T-table. ments. The performance of the implementation is compa- For a Large T-table implementation, the T-table occu- rable, but requires efficient non word-aligned mem- pies 32 cache lines, and the probability of not accessing ory accesses. We refer to this as the Large T-table an entry is reduced to 0.6%. This, although not exploited implementation. in a realistic attack, could lead to key recovery with suf- ficiently many measurements. An adversary observing Depending on the implementation style, implementa- each memory access separately, however, can learn 5 tions can be more susceptible to cache attacks or less. bits per access, as each cache line contains only 8 of the The resolution an attacker gets depends on the cache line larger entries. size, which is 64 bytes on our target architecture. For Note that an attacker that gets to observe every sin- the S-box implementation, the S-box occupies a total of gle access of the aforementioned AES implementations 4 cache lines (256 bytes). That is, an attacker able to would succeed to recover the key with significantly fewer learn for each observed access to a table entry at most traces, as she gets to know the entry accessed at every two bits. Attacks relying on probabilistic observations point in the execution. This scenario was analyzed in [6] of the S-box entries not being accessed during an en- with simulated cache traces. Their work focuses on retire encryption [31] would observe such a case with a covering the key based on observations made in the first probability of 1.02 · 10−20, making a micro-architectural and second AES rounds establishing relations between attack nearly infeasible. For a 4 T-tables implementa- the first and second round keys. As a result, they succeed tion, each of the T-tables gets 40 accesses per encryp- on recovering an AES key from a 4 T-table implementation, 4 per round, and occupies 16 cache lines. There- tion with as few as six observed encryptions in a noise fore, the probability of a table entry not being accessed free environment. in an entire encryption is 8%, a fact that was exploited in [31] to recover the full key. In particular, all these works target either the first or the last round to avoid the 5.2 Non-vulnerable AES Implementations MixColumns operation. In the first round, the intermediate state before the MixColumns operation is given by There are further efficient implementations of AES that 0 0 0 si = Ti[pi ⊕ki ], where pi and ki are the plaintext and first are not automatically susceptible to cache attacks, as they round key bytes i, Ti is the table utilization corresponding avoid secret-dependent memory accesses. These imple-

7 Attacker primes Prefetch table Start Finish Attacker probes

AES round

Figure 4: Prefetching and the timeline effect for a regular Prime+Probe attack. mentation styles include bit-sliced implementations [38], not be executed within the execution of a single AES implementations using vector instructions [25], constant round. Thanks to prefetching, the attacker is only able memory access implementations and implementations to see cache hits on all the Table entries. We analyze using AES instruction set extensions on modern Intel whether those countermeasures, implemented in many CPUs [27]. However, they all come with their separate cryptographic libraries, resist the scenario in which an drawbacks. The bit-sliced implementations need data to attacker fully controls the OS and can interrupt the AES be reformatted before and after encryption and usually process after every small number of accesses. As it was show good performance only if data is processed in large explained in Section 2, attacking SGX gives a malicious chunks [9]. Constant memory access implementations OS advarsary almost full temporal resolution, which can also suffer from performance as the number of mem- reverse the effect of prefetching mechanisms. ory accesses during an encryption significantly increases. While hardware support like AES-NI combines absence 6 CacheZooming SGX-based AES of leakage with highest performance, it is only an option if implemented and if the hardware can be trusted [50], We use CacheZoom to retrieve secret keys of different and further might be disabled in BIOS configuration op- implementations of AES running inside an enclave. As tions. mentioned in section 4.1, we assume no knowledge of the encryption key, but to have access to the enclave binary, 5.3 Cache Prefetching as a Countermea- and thus to the offset of the substitution tables. We fur- sure ther assume the enclave is performing encryptions over a set of known plaintext bytes or ciphertext bytes. In response to cache attacks in general and AES attacks in particular, several cryptographic library designers im- 6.1 T-table Implementations plement cache prefetching approaches, which just load the key dependent data or instructions to the cache prior Our first attacks target the T-table implementations. To to their possible utilization. In the case of AES, this sim- recover the AES key from as few traces as possible, we ply means loading all the substitution tables to the cache, recover the memory access pattern of the first 2 rounds either once during the encryption (at the beginning) or of the AES function. A perfect single trace first round before each round of AES. Prefetching takes advantage attack reveals at most the least significant 4 and 5 bits of the low temporal resolution that an attacker obtains of each key byte in 4 T-table (16 entries/cache line) and when performing a regular non-OS controlled attack, as Large T-table implementations (8 entries/cache line) re- it assumes that an attacker cannot probe faster than the spectively. As we want to retrieve the key with the min- prefetching. Translated to AES, prefetching assumes that imal number of traces, we also retrieve the information a cache attack does not have enough temporal granular- from the accesses in the second round and use the rela- ity to determine which positions in the substitution table tion between the first and second round key. In particu- have been used if they are prefetched, e.g., at the begin- lar, we utilize the relations described in [6], who utilized ning of each round. simulated data to demonstrate the effectiveness of their An example of the implications that such a counter- AES key recovery algorithm. measure will have on a typical cache attack can be ob- In our specific practical attack, we face three prob- served in Figure 4. The Prime+Probe process can- lems: (1) Even in our high resolution attack, we have

8 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25

Set Number 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 Round 1 7 6 5 Round 2 4 3 2 Round 3 1 0 3.948 3.95 3.952 3.954 3.956 3.958 3.96 3.962 Measurement 10 4

Figure 5: Memory footprint of the AES execution inside enclave.

noise that adds false positives and negatives to our ob- 1 served memory access patterns. (2) Our experiments 0.9 show that the out-of-order execution and parallel pro- 0.8 cessing of memory accesses does not allow for a full 0.7 serialization of the observed memory accesses. (3) Sep- arating memory accesses belonging to different rounds 0.6 can be challenging. These first two facts can be observed 0.5 in Figure 5, which shows 16 memory accesses to each 0.4 round of a 4 T-table (4 access per table) AES. Due to our Success rate high resolution channel and the out-of-order execution 0.3 of instructions, we observe that we interrupt the out-of- 0.2 Unordered 4 T Ordered 4 T order execution pipeline while a future memory access is 0.1 Unordered Large T being fetched. Thus, interrupting the processor and evict- Ordered Large T 0 ing the entire L1D cache on each measurement forces the 0 5 10 15 20 25 30 35 processor to repeatedly load the cache line memory until Number of samples the target read instruction execution completes. Hence, Figure 6: Key recovery success rate. attributing observed accesses to actual memory accesses in the code is not trivial. Although this behavior adds some confusion, we show that observed accesses still have minimal order that we can take into account. As cesses to a set within a round are not separated and are for the third fact, it involves thorough visual inspection considered part of the same access. After applying this of the collected trace. In particular, we realized that ev- filter to the first and second round traces, we apply the ery round start involves the utilization of a substantially key recovery algorithm, as explained in [6]. The accu- higher number of sets than the rest, also observable in racy of our measurements with respect to the aforemen- Figure 5. tioned issues can be seen in Table 1. For the 4 T-table implementation, 55% of the accesses correspond to true accesses (77% of them were ordered), 44% of them were In the first implementation of our key recovery algo- noisy accesses and 56% of the true accesses were missed. rithm, we just use the set access information without tak- For the single Large T-table implementation, 75% of the ing into account the ordering of our observed accesses. T-table accesses corresponded to true accesses (67% or- Recall that we have access to the binary executed by the dered), 24% were noisy accesses and 12% of the true enclave, and thus, we can map each set number to its accesses were missed. The quality of the data is worse corresponding T-table entry. This means that all our ac- in the 4 T-table case because they occupy larger number cesses can be grouped on a T-table basis. Duplicated ac- of sets and thus include more noisy lines, as explained in

9 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25

Set Number 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 Prefetch 7 6 5 Round 1 4 3 2 Round 2 1 0 2.945 2.95 2.955 2.96 2.965 2.97 2.975 Measurement 10 4

Figure 7: Memory footprint of the AES execution inside an enclave with prefetch countermeasure. The prefetch is clearly distinguishable and helps to identify the start of each round. Further, it also highlights out-of-order execution and in-order completion.

Implementation 4 T-table Large T-table table implementation (represented circles) to get the key True Positive 55% 75% with 90% probability. Thus, we can conclude that using False Positive 44% 24% the approximate order helped us to recover the key with False Negative 56% 12% fewer traces. Ordered 77% 67% , Table 1: Statistics on recovered memory accesses for T- 6.1.1 Cache Prefetching table implementations. as explained in Section 5, is implemented to prevent pas- sive attackers from recovering AES keys. CacheZoom, in theory, should bypass such a countermeasure by being Figure 2. able to prime the cache after the T-tables are prefetched. With these statistics and after applying our key recov- The observation of a trace when cache prefetching is im- ery algorithms with varying number of traces we ob- plemented before every round can be observed in Fig- tained the results presented in Figure 6. If we do not ure 7. We can see how cache prefetching is far from pre- consider the order in our experiments, we need roughly venting us to recover the necessary measurements. In 20 traces (crosses and diamonds) to get the entire correct fact, it eases the realization of our attack, as we now key with 90% probability in both the 4 T-table and single can clearly distinguish accesses belonging to different T-table implementations. rounds, allowing for further automation of our key recov- To further improve our results, we attempt to utilize ery step. Thus, CacheZoom not only bypasses but further the partial order of the observed accesses. We obtain beneﬁts from mechanisms that mitigated previous cache the average position for all the observed accesses to a attacks. set within one round. These positions are, on average, close to the order in which sets were accessed. The ob- 6.2 S-Box Implementation served order is then mapped to the order in which each T-table should have been utilized. Since this information S-box implementation is seen as a remedy to cache at- is not very reliable, we apply a score and make sure mis- tacks, as all S-box accesses use only a very small num- orderings are not automatically discarded. After apply- ber of cache lines (typically 4). With 160 S-Box ac- ing this method, the result for our key recovery algorithm cesses per encryption, each line is loaded with a very can be observed again in Figure 6, for which we needed high likelihood and thus prevents low resolution attack- around 15 traces for the 4 T-table implementation (rep- ers from gaining information. Adding a prefetch for each resented with stars) and 12 traces for the single Large T- round does not introduce much overhead and also pre-

10 vents previous attacks that attempted interrupting the execution [14, 24]. However, CacheZoom can easily dis- 0.15 tinguish S-box accesses during the rounds, but due to the 0.1 out-of order execution, it is not possible to distinguish accesses for different byte positions in a reliable man- 0.05 ner. However, one distinguishable feature is the number of accesses each set sees during a round. We hypothe- 0 size that the number of observed accesses correlates with 2 4 6 8 10 12 14 16 the number of S-box lookups to that cache line. If so, a Figure 8: Correlation between observed and expected ac- classic DPA correlating the observed accesses to the pre- cesses caused by one byte position. Leakage is stronger dicted accesses caused by one state byte should recover for later bytes. Correlation of observed (blue) vs. relative the key byte. Hence we followed a classic DPA-like at- accesses (amber). tack on the last round, assuming known ciphertexts. The model used is rather simple: for each key byte k, the accessed cache set during the last round for a given 0.15 ciphertext byte c is simply given as set = S−1(x⊕k) 6, i.e. the two MSBs of the corresponding state byte before 0.1 the last SubBytes operation. The access profile for a state byte position under an assumed key k and given cipher- 0.05 text bytes can be represented by a matrix A where each 0 row corresponds to a known ciphertext and each column indicates whether that ciphertext resulted in an access 0 50 100 150 200 250 to the cache line with the same column index. Hence, Figure 9: Correlation of key values for the best (k15, am- each row has four entries, one per cache line, where the ber) and worst (k0, blue) key bytes with 1500 traces. The cache line with an access is set to one, and the other three guess with the highest correlation (o) and the correct key columns are set to zero (since that state byte did not cause (x) match only for k15. an access). Our leakage is given as a matrix L, where each row corresponds to a known ciphertext and each column to the number of observed accesses to one of the ure 8. It can be observed that the correlation for the later 4 cache lines. A correlation attack can then be performed key bytes is much stronger than for the earlier key bytes. by computing the correlation between A and L, where A This explains why later key bytes are much easier to re- is a function of the key hypothesis. We used synthetic, cover. The plot also shows a comparison of using the ab- noise-free simulation data for the last AES round to vali- solute number of observed accesses (ranging between 10 date our approach, where accesses for 16 bytes are accu- and 80 observed accesses per round, blue) an the relative mulated over 4 cache lines for numerous ciphertexts un- number of accesses per cache set (amber) after removing der a set key. The synthetic data shows a best expectable outliers. correlation of about .25 between noise-free cumulative Results for the best and the worst key guess are shown accesses L and the correct accesses for a single key byte in Figure 9. For k15 (amber), the correlation for the cor- A. As little as 100 observations yield a first-order success rect key guess is clearly distinguishable. For k0 however, rate of 93%. the correct key guess does not show any correlation with Next, we gathered hundreds of measurements using the used 1500 observations. In summary, 500 traces are CacheZoom. Note that due to a lack of alignment, the sufficient to recover 64 key bits, while 1500 recover 80 collection of a large number of observations and the ex- key bits reliably. While full key recovery will be chal- traction of the last round information still requires man- lenging, recovering 12 out of 16 key bytes is easily pos- ual intervention. When performing the key recovery at- sible with thousands of observations. The remaining key tack, even 200 observations yielded 4-5 key bytes cor- bytes can either be brute-forced or can be recovered by rectly. However, the first-order success rate only in- exploiting leakage from the second last round. creases very slowly with further measurements. We fur- Next, we explain the reason why we believe bytes ther observed that (1) more traces always recover later processed first are harder to recover. The Intel core i7 key bytes first and (2) key ranks for earlier lookups are uses deep pipelines and speculative out-of-order execu- often very low, i.e. the correct key does not even yield tion. Up to six micro-instructions can be dispatched per a high correlation. To analyze this behavior, we simply clock cycle, and several instructions can also complete correlated the expected leakage A for each byte position per cycle. As a result, getting order information for the to the observed leakage L. The result is shown in Fig- accesses is difficult, especially if 16 subsequent S-box

11 reads are spread over only 4 cache lines. While execu- independent memory accesses. As SGX’s intended use tion is out-of-order, each instruction and its completion is the protection of sensitive information, enclave devel- state are tracked in the CPU’s reorder buffer (ROB). In- opers must thus use the necessary care when developing struction results only affect the system state once they are code and avoid microarchitectural leakages. For AES completed and have reached the top of the ROB. That is, specifically, SGX implementations must feature con- micro-ops retire in-order, even though they execute out- stant memory accesses. Possible implementation styles of-order. The result of micro-ops that have completed are thus bit-sliced or vectorized-instruction-based imple- hence do not immediately affect the system. In our case, mentations or implementations that access all cache lines if the previous load has not yet been serviced, the sub- for each look-up. sequent completed accesses cannot retire and affect the Acknowledgments This work is supported by the system until the unserviced load is also completed. National Science Foundation, under the grant CNS- Every context switch out of an enclave requires the 1618837. CPU to flush the out-of order execution pipeline of CacheZoom source repository and data sets are the CPU [17]. Hence CacheZoom’s interrupt causes a available at https://github.com/vernamlab/ pipeline flush in the CPU, all micro-ops on the ROB that CacheZoom. are not at the top and completed will be discarded. Since our scheduler switches tasks very frequently, many loads References cannot retire and thus the same load operation has to be serviced repeatedly. This explains why we see between [1]A CIIÇ MEZ,O.,KOÇ , Ç. K., AND SEIFERT, J.-P. On the power 9 and 90 accesses to the S-box cache lines although there of simple branch prediction analysis. In Proceedings of the 2nd ACM symposium on Information, computer and communications are only 16 different loads to 4 different cache lines. The security (2007), ACM, pp. 312–320. loads for the first S-box are, however, the least affected [2]A CIIÇ MEZ,O., AND SCHINDLER, W. A vulnerability in rsa im- by preceding loads. Hence, they are the most likely to plementations due to instruction cache analysis and its demon- complete and retire from the ROB after a single cache ac- stration on openssl. In Topics in Cryptology–CT-RSA 2008. cess. Later accesses are increasingly likely to be serviced Springer, 2008, pp. 256–273. more than once, as their completion and retirement is de- [3]A LLAN, T., BRUMLEY,B.B.,FALKNER,K., VAN DE POL,J., pendent on preceding loads. Since our leakage model AND YAROM, Y. Amplifying side channels through performance degradation. In Proceedings of the 32nd Annual Conference on assumes such behavior (in fact, we assume one cache ac- Computer Security Applications (2016), ACM, pp. 422–435. cess per load), the model becomes increasingly accurate [4] ARM TrustZone. https://www.arm.com/products/ for later accesses. security-on-arm/trustzone. Accessed: August 22, 2017. [5]A RNAUTOV,S.,TRACH,B.,GREGOR, F., KNAUTH, T., MAR- TIN,A.,PRIEBE,C.,LIND,J.,MUTHUKUMARAN,D.,OKE- 7 Conclusion EFFE,D.,STILLWELL,M.L., ETAL. SCONE: Secure linux containers with Intel SGX. In 12th USENIX Symposium on Op- This work presented CacheZoom, a new tool to analyze erating Systems Design and Implementation (OSDI 16) (2016), memory accesses of SGX enclaves. To gain maximal res- USENIX Association. olution, CacheZoom combines a L1 cache Prime+Probe [6]A SHOKKUMAR,C.,GIRI, R. P., AND MENEZES, B. Highly attack with OS modifications that greatly enhance the Efficient Algorithms for AES Key Retrieval in Cache Access At- tacks. In Security and Privacy (EuroS&P), 2016 IEEE European time resolution. SGX makes this scenario realistic, as Symposium on (2016), IEEE, pp. 261–275. both a modified OS and knowledge of the unencrypted [7]B AUMANN,A.,PEINADO,M., AND HUNT, G. Shielding appli- binary are realistic for enclaves. We demonstrate that cations from an untrusted cloud with haven. ACM Transactions CacheZoom can be used to recover key bits from all ma- on Computer Systems (TOCS) 33, 3 (2015). jor software AES implementations, including ones that [8]B ENGER,N., VAN DE POL,J.,SMART, N. P., AND YAROM, use prefetches for each round as a cache-attack coun- Y. Ooh Aah... Just a Little Bit: A small amount of side channel termeasure. Furthermore, keys can be recovered with can go a long way. In International Workshop on Cryptographic Hardware and Embedded Systems (2014), Springer, pp. 75–92. as few as 10 observations for T-table based implementa- [9]B ERNSTEIN,D.J., AND SCHWABE, P. New AES software tions. For the trickier S-box implementation style, 100s speed records. In International Conference on Cryptology in In- of observations reveal sufficient key information to make dia (2008), Springer, pp. 322–336. full key recovery possible. Prefetching is in this sce- [10]B HATTACHARYA,S., AND MUKHOPADHYAY, D. Who watches nario beneficial to the adversary, as it helps identifying the watchmen?: Utilizing Performance Monitors for Compro- and separating the accesses for different rounds. A list of mising keys of RSA on Intel Platforms. In International Work- shop on Cryptographic Hardware and Embedded Systems (2015), libraries that contain vulnerable implementations can be Springer, pp. 248–266. found at table 2. [11]B ONNEAU,J., AND MIRONOV, I. Cache-collision timing attacks CacheZoom serves as evidence that security-critical against AES. In International Workshop on Cryptographic Hard- code needs constant execution flows and secret- ware and Embedded Systems (2006), Springer.

12 Library Vulnerable Implementations OpenSSL 1.1.0f aes core.c T-table, aes x86core.c Large T-table, S-box and prefetching configurable through AES COMPACT IN INNER ROUNDS, AES COMPACT IN OUTER ROUNDS WolfCrypt 3.11.0 aes.c T-Table with prefetching before the first round. Mozilla NSS 3.30.2 rijndael.c T-Table and S-box configurable through RIJNDAEL GENERATE VAL- UES MACRO Nettle 3.3 aes-encrypt-internal.asm T-table. Libtomcrypt 1.17 aes.c T-table. Libgcrypt 1.7.7 rijndael.c T-table, S-box for the last round with prefetching. MbedTLS 2.4.2 aes.c T-table, S-box for the last round.

Table 2: Vulnerable implementations in popular current cryptographic libraries. These implementations can be con- ﬁgured through compile/runtime settings.

[12]B RASSER, F., MULLER¨ ,U.,DMITRIENKO,A.,KOSTIAINEN, [25]H AMBURG, M. Accelerating AES with vector permute instruc- K.,CAPKUN,S., AND SADEGHI, A.-R. Software Grand tions. In Cryptographic Hardware and Embedded Systems-CHES Exposure: SGX Cache Attacks Are Practical. arXiv preprint 2009. Springer, 2009, pp. 18–32. arXiv:1702.07521 (2017). [26]I NCI,M.S.,GULMEZOGLU,B.,IRAZOQUI,G.,EISENBARTH, [13]B RICKELL,E.,GRAUNKE,G.,NEVE,M., AND SEIFERT, J.-P. T., AND SUNAR, B. Cache attacks enable bulk key recovery on Software mitigations to hedge AES against cache-based software the cloud. In International Conference on Cryptographic Hard- side channel vulnerabilities. IACR Cryptology ePrint Archive ware and Embedded Systems (2016), Springer, pp. 368–388. 2006 (2006), 52. [27]I NTEL. Intel Data Protection Technology with AES-NI and Se- ´ ´ [14]B RIONGOS,S.,MALAGON, P., RISCO-MARTIN,J.L., AND cure Key. MOYA, J. M. Modeling side-channel cache attacks on aes. In Proceedings of the Summer Computer Simulation Conference [28] ISCA 2015 tutorial slides for Intel SGX. https://software. (2016), Society for Computer Simulation International, p. 37. intel.com/sites/default/files/332680-002.pdf. Ac- cessed: August 22, 2017. [15]B RUMLEY,D., AND BONEH, D. Remote timing attacks are practical. Computer Networks 48, 5 (2005). [29] Intel SGX. https://software.intel.com/en-us/sgx. Ac- [16]C HEN,S.,ZHANG,X.,REITER,M.K., AND ZHANG, Y. De- cessed: August 22, 2017. tecting privileged side-channel attacks in shielded execution with [30]I RAZOQUI,G.,EISENBARTH, T., AND SUNAR, B. S $ A: A dej´ a´ vu. In Proceedings of the 2017 ACM on Asia Conference on Shared Cache Attack That Works across Cores and Deﬁes VM Computer and Communications Security (2017), ACM, pp. 7–18. Sandboxing–and Its Application to AES. In 2015 IEEE Sympo- [17]C OSTAN, V., AND DEVADAS, S. Intel SGX explained. sium on Security and Privacy (2015), IEEE, pp. 591–604. Tech. rep., Cryptology ePrint Archive, Report 2016/086, 2016. [31]I RAZOQUI,G., I˙NCI,M.S.,E˙ ISENBARTH, T., AND SUNAR, https://eprint. iacr. org/2016/086, 2016. B. Wait a Minute! A fast, Cross-VM Attack on AES. In RAID [18]C OSTAN, V., LEBEDEV,I., AND DEVADAS, S. Sanctum: (2014), pp. 299–319. Minimal hardware extensions for strong software isolation. In USENIX Security (2016), vol. 16, pp. 857–874. [32]K OCHER, P. C. Timing attacks on implementations of Difﬁe- Hellman, RSA, DSS, and other systems. In Annual International [19]D AHBUR,K.,MOHAMMAD,B., AND TARAKJI, A. B. A sur- Cryptology Conference (1996), Springer, pp. 104–113. vey of risks, threats and vulnerabilities in cloud computing. In Proceedings of the 2011 International conference on intelligent [33]L ANGNER, R. Stuxnet: Dissecting a cyberwarfare weapon. IEEE semantic Web-services and applications (2011), ACM, p. 12. Security & Privacy 9, 3 (2011), 49–51.

[20]E VTYUSHKIN,D.,PONOMAREV,D., AND ABU-GHAZALEH, [34]L EE,S.,SHIH, M.-W., GERA, P., KIM, T., KIM,H., AND N. Jump Over ASLR: Attacking Branch PredShared Cache At- PEINADO, M. Inferring Fine-grained Control Flow Inside SGX tictors to Bypass ASLR. In IEEE/ACM International Symposium Enclaves with Branch Shadowing. Tech. rep., arxiv Archive, on Microarchitecture (MICRO) (2016). 2016. https://arxiv.org/pdf/1611.06952.pdf, 2017. [21]G E,Q.,YAROM, Y., COCK,D., AND HEISER, G. A Survey [35]L IPP,M.,GRUSS,D.,SPREITZER,R., AND MANGARD, S. Ar- of Microarchitectural Timing Attacks and Countermeasures on mageddon: Last-level cache attacks on mobile devices. arXiv Contemporary Hardware. IACR Eprint (2016). preprint arXiv:1511.04897 (2015). [22]G OTZFRIED¨ ,J.,ECKERT,M.,SCHINZEL,S., AND MULLER¨ , T. Cache Attacks on Intel SGX. In EUROSEC (2017), pp. 2–1. [36]L IU, F., YAROM, Y., GE,Q.,HEISER,G., AND LEE,R.B. Last-level cache side-channel attacks are practical. In IEEE Sym- [23]G RUSS,D.,MAURICE,C., AND MANGARD, S. Rowhammer. posium on Security and Privacy (2015). js: A remote software-induced fault attack in javascript. In De- tection of Intrusions and Malware, and Vulnerability Assessment. [37]L IU, W., DI SEGNI,A.,DING, Y., AND ZHANG, T. Cache- Springer, 2016, pp. 300–321. timing attacks on aes. New York University (2013). [24]G ULLASCH,D.,BANGERTER,E., AND KRENN, S. Cache [38]M ATSUI,M., AND NAKAJIMA, J. On the power of bitslice im- Games–Bringing Access-Based Cache Attacks on AES to Prac- plementation on Intel Core2 processor. In International Work- tice. In 2011 IEEE Symposium on Security and Privacy (2011), shop on Cryptographic Hardware and Embedded Systems (2007), IEEE, pp. 490–505. Springer, pp. 121–134.

13 [39]M OGHIMI,A.,IRAZOQUI,G., AND EISENBARTH, T. [56]Z HANG, Y., JUELS,A.,REITER,M.K., AND RISTENPART, Cachezoom: How sgx ampliﬁes the power of cache attacks. T. Cross-vm side channels and their use to extract private keys. Cryptology ePrint Archive, Report 2017/618, 2017. http:// In Proceedings of the 2012 ACM conference on Computer and eprint.iacr.org/2017/618. communications security (2012), ACM, pp. 305–316. [40]M ORRIS, T. Trusted platform module. In Encyclopedia of Cryp- [57]Z HANG, Y., JUELS,A.,REITER,M.K., AND RISTENPART, T. tography and Security. Springer, 2011, pp. 1332–1335. Cross-tenant side-channel attacks in PaaS clouds. In Proceedings [41]O REN, Y., KEMERLIS, V. P., SETHUMADHAVAN,S., AND of the 2014 ACM SIGSAC Conference on Computer and Commu- KEROMYTIS, A. D. The spy in the sandbox: Practical cache nications Security (2014), ACM, pp. 990–1003. attacks in javascript and their implications. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communica- tions Security (2015), ACM, pp. 1406–1418. [42]O SVIK,D.A.,SHAMIR,A., AND TROMER, E. Cache attacks and countermeasures: the case of AES. In Cryptographers Track at the RSA Conference (2006), Springer. [43]P ERCIVAL, C. Cache missing for fun and proﬁt, 2005. [44]R ISTENPART, T., TROMER,E.,SHACHAM,H., AND SAVAGE, S. Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In Proceedings of the 16th ACM conference on Computer and communications security (2009), ACM, pp. 199–212. [45]S CHUSTER, F., COSTA,M.,FOURNET,C.,GKANTSIDIS,C., PEINADO,M.,MAINAR-RUIZ,G., AND RUSSINOVICH,M. VC3: trustworthy data analytics in the cloud using SGX. In 2015 IEEE Symposium on Security and Privacy (2015), IEEE. [46]S CHWARZ,M.,WEISER,S.,GRUSS,D.,MAURICE,C., AND MANGARD, S. Malware guard extension: Using SGX to conceal cache attacks. arXiv preprint arXiv:1702.08719 (2017). [47]S EO,J.,LEE,B.,KIM,S.,SHIH, M.-W., SHIN,I.,HAN, D., AND KIM, T. SGX-Shield: Enabling address space layout randomization for SGX programs. In Proceedings of the 2017 Annual Network and Distributed System Security Sympo- sium (NDSS), San Diego, CA (2017). [48]S HIH, M.-W., LEE,S.,KIM, T., AND PEINADO, M. T-SGX: Eradicating controlled-channel attacks against enclave programs. In Proceedings of the 2017 Annual Network and Distributed Sys- tem Security Symposium (NDSS), San Diego, CA (2017). [49]S HINDE,S.,CHUA,Z.L.,NARAYANAN, V., AND SAXENA, P. Preventing Page Faults from Telling Your Secrets. In Pro- ceedings of the 11th ACM on Asia Conference on Computer and Communications Security (2016), ACM, pp. 317–328. [50]T AKEHISA, T., NOGAWA,H., AND MORII, M. AES Flow In- terception: Key Snooping Method on Virtual Machine-Exception Handling Attack for AES-NI-. IACR Cryptology ePrint Archive 2011 (2011), 428. [51]T SUNOO, Y., SAITO, T., SUZAKI, T., SHIGERI,M., AND MIYAUCHI, H. Cryptanalysis of DES implemented on computers with cache. In International Workshop on Cryptographic Hard- ware and Embedded Systems (2003), Springer, pp. 62–76. [52]W EICHBRODT,N.,KURMUS,A.,PIETZUCH, P., AND KAPITZA, R. AsyncShock: Exploiting Synchronisation Bugs in Intel SGX Enclaves. In European Symposium on Research in Computer Security (2016), Springer, pp. 440–457. [53]X U, Y., CUI, W., AND PEINADO, M. Controlled-channel attacks: Deterministic side channels for untrusted operating systems. In 2015 IEEE Symposium on Security and Privacy (2015), IEEE, pp. 640–656. [54]Y AROM, Y., AND FALKNER, K. Flush+reload: a high resolution, low noise, L3 cache side-channel attack. In 23rd USENIX Security Symposium (USENIX Security 14) (2014), pp. 719–732. [55]Z HANG, Y., JUELS,A.,OPREA,A., AND REITER,M.K. Homealone: Co-residency detection in the cloud via side-channel analysis. In 2011 IEEE Symposium on Security and Privacy (2011), IEEE, pp. 313–328.