Conference paper Open Access

Prefetch Side-Channel Attacks: Bypassing SMAP and Kernel ASLR

Daniel Gruss; Clémentine Maurice; Moritz Lipp; Stefan Mangard; Anders Fogh


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.375513", 
  "title": "Prefetch Side-Channel Attacks: Bypassing SMAP and Kernel ASLR", 
  "issued": {
    "date-parts": [
      [
        2016, 
        10, 
        24
      ]
    ]
  }, 
  "abstract": "<p>Modern operating systems use hardware support to protect against control flow hijacking attacks such as code-injection<br>\nattacks. Typically, write access to executable pages is prevented and kernel mode execution is restricted to kernel code<br>\npages only. However, current CPUs provide no protection against code-reuse attacks like ROP. ASLR is used to prevent<br>\nthese attacks by making all addresses unpredictable for an attacker. Hence, the kernel security relies fundamentally<br>\non preventing access to address information. We introduce Prefetch Side-Channel Attacks, a new class of generic attacks exploiting major weaknesses in prefetch instructions. This allows unprivileged attackers to obtain address information and thus compromise the entire system by defeating SMAP, SMEP, and kernel ASLR. Prefetch can fetch inaccessible privileged memory into various caches on Intel x86. It also leaks the translation-level for virtual addresses on both Intel x86 and ARMv8-A. We build three attacks exploiting these properties. Our rst attack retrieves an exact image of the full paging hierarchy of a process, defeating both user space and kernel space ASLR. Our second attack resolves virtual to physical addresses to bypass SMAP on 64-bit Linux systems, enabling ret2dir attacks. We demonstrate this from unprivileged user programs on Linux and inside Amazon EC2 virtual machines. Finally, we demonstrate how to defeat kernel ASLR on Windows 10, enabling ROP attacks on kernel and driver binary code. We propose a new form of strong kernel isolation to protect commodity systems incuring an overhead of only 0:06{5:09%.</p>", 
  "author": [
    {
      "family": "Daniel Gruss"
    }, 
    {
      "family": "Cl\u00e9mentine Maurice"
    }, 
    {
      "family": "Moritz Lipp"
    }, 
    {
      "family": "Stefan Mangard"
    }, 
    {
      "family": "Anders Fogh"
    }
  ], 
  "type": "paper-conference", 
  "id": "375513"
}
67
31
views
downloads
All versions This version
Views 6767
Downloads 3131
Data volume 27.2 MB27.2 MB
Unique views 6666
Unique downloads 2828

Share

Cite as