# Secure Computer Systems

## Protecting TCB

Notice a tyop typo? Please submit an issue or open a PR.

# Protecting the TCB from Untrusted Applications

## Background

The TCB must be isolated from untrusted code. This is accomplished with support from the hardware. Not only is the TCB isolated from untrusted applications. Applications are isolated from each other. When one application breaks it isn't caused by another application.

We investigate how the hardware helps us meet the requirement that the TCB is isolated/tamper proof.

We trust that the hardware works.

The hardware provides two mechanisms for isolating the TCB and applications.

• Processor execution modes (privilege levels). The hardware is aware of if the processor is executing untrusted code.
• Privileged instructions. Some instructions cannot be executed by the processor outside of the TCB.

What exactly are we isolating? We are isolating processes. Processes are executed by a processor which executes instructions. A processor does the following

• EIP holds a pointer to the next instruction
• Operands point to data which is operated on by an instruction
• Executes next instruction

Addresses are logical, meaning the process uses an address that is not the actual physical address. This logical address is mapped to a physical address to access data. Two processes may reference the same logical address, but each processes logical address maps to a different physical address. Isolation is achieved by ensuring that each process can only access memory that is made available to it.

You could imagine a simple implementation where the bounds of each process' allocated physical memory is tracked by a bounds register. This bounds register can only be modified by the TCB so that untrusted code cannot give itself access to memory it shouldn't have access to.

## Address Spaces on Modern Processor Architectures (Intel x86)

This is not in-depth, we focus on concepts and we focus on the Intel x86 architecture. This architecture had modes real vs. protected on 32 bit and long vs flat modes on 64 bit.

Logical address space can be split into variable size logical units called segments. There can be different segments for the code, data, stack, etc... Segments can further be divided into pages, which are a fixed size.

The logical address can be given by (segment number, page number, page offset).

This mapping is stored in global and local descriptor tables (GDT and LDT). The LDT is for the process and the GDT is for the TCB.

See that there are different segments of memory (stack, heap, code) for the process.

We have a segment table that translates between logical addresses and physical addresses. How do we compute the physical address?

SGTBR = Segment Table Base Register, this is where the segment table starts.

STE = Segment Table Entry Number

Physical address = *(SGTBR+STE*STE Size) + displacement

Intuition: We start at the segment table base register, which is just the starting location of the register. We add STESTE size to calculate the location of the segment within the register. (SGTBR+STE*STE Size) is C notation for finding the value at the address, which is a location in physical memory, and we add the displacement to get the exact location in physical memory.

Some checks are performed to ensure we access physical memory belonging to the process, displacement <= segment size.

Segment tables are also called descriptor tables, and there are separate tables for user mode (Local Descriptor Table or LDT) and system mode execution (Global Descriptor Table or GDT).

Earlier we gave a formula -

Physical address = *(SGTBR+STE*STE Size) + displacement

This formula seems to be a simplification, and we actually use the formula several times. We repeatedly are given an address that contains another address, go to the referenced address and use an offset to find our next value. Ultimately we end up at the physical address space.

For a 32 bit architecture we take the logical address (a.k.a. far pointer) and calculate the linear address, which then allows us to calculate the physical address as shown in the diagram below.

The diagram for 64 bit architectures has no GDT that maps to a linear adddress. The process is very much the same as before though.

PML4 stands for "Page map level 4" and CR3 is a register that points to its location.

We access tables in address translation. These tables determine what phsyical memory we can access. These tables must belong to the portion of memory for the OS so that the user cannot modify them. If the user could modify them there is no isolation.

These lookups would slow down the program, but we have a "translation lookaside buffer" which stores mappings from logical addresses to physical addresses. This is in the hardware.

## Protecting Program Memory in the x86 Architecture

Isolation comes from protecting program memory. Each segment contains protection level information about the segment, called the segment descriptor protection level (DPL).

There are 4 protection level specified by 2 bits, going from 0 to 3. 0 is the most privileged.

There is a current protection level (CPL) which is the DPL of the code segment being executed.

Requestor privilege level (RPL) is used to stop privilege escalation attacks. The RPL is stored in the segment selector (an entry of the GDT/LDT).

A protection check happens where max(CPL, RPL) $\leq$ DPL of target.

The diagram below shows access that is not allowed with dashed lines and allowed access with solid lines.

## More Memory Protection Details

### Conforming vs non-conforming code segments.

For conforming code segments when transfering from one code segment to another code segment (that potentially has different privileges) we can continue execution at the current privilege level. Useful for system utilities.

For non-conforming code segments we get a protection fault unless call or task gate is specified. Call gates can be used to transfer to different privilege levels (or through system call instructions). All data segments are non-conforming.

### Page Level Protection

• Page Protection Level (PPL) is either 0 or 1. 0 is privileged level and 1 is non-privileged level.
• If the CPL is 3 we can only access PPL of 1.
• There are read-write protections on pages as well.
• You can also disable execution of a page.

Segment and page protections can be combined.

## Changing Privilege Level and System Calls

If you are trying to access code from a higher privilege level (i.e. the OS) you can come to the OS from a special entry point called a call gate. The call gate will specify the code you want to access as well as the privilege level that you can come from.

In the case that the code segment is conforming we can continue running at the same privilege level we came from and no stack switch occurs. If it is nonconforming we have to switch the stack.

## SYSENTER and SYSEXIT

There are now instructions for system calls, SYSENTER for transferring from level 3 to level 0, and SYSEXIT for transferring from level 0 to level 3.

In the diagram below see the registers that are used to create the necessary execution context.

## Privileged Instructions

A big list of privileged instructions is given. Notably, the GDT register and LDT register control what physical memory we have access to. By making the loading of these privileged instructions we can ensure isolation.

## Attacks Against Hardware and Operating Systems

### Row Hammer

Although we take precautions to prevent attacks, attacks are still possible. The "row hammer" attack is where we repeatedly read memory from "DRAM" (some memory that we can read) we can cause bit flips in adjacent memory that gives us write access to our page table, allowing us to go where we should not.

### Rootkits

Malicious software that runs in kernel mode and can change OS memory. NVD CVE-2019-6218 (entry in National Vulnerability Database) is that a malicious application can execute arbitrary code with kernel privileges (input validation issue in iOS, macOS, etc.).

## Memory Protection and Software Security

### System Level Software Security Techniques

ASLR is (Address Space Layout Randomization) makes it hard for an attacker to find where some specific variable is. There are some ways to get around this.

A non-executable stack. Never execute (NX) or disable execute (DX) bits. Eliminates vulnerabilities where malicious code is executed from the stack, but there are workaround attacks like return-to-libc attack.

## Summary

Through understanding how physical memory is accessed via address translation, understanding memory protection, and privileged instructions, we can see how the TCB is protected from untrusted applications.

OMSCS Notes is made with in NYC by Matt Schlenker.