papers

Publications (5)

cs.CR2022

Chameleon Cache: Approximating Fully Associative Caches with Random Replacement to Prevent Contention-Based Cache Attacks

Thomas Unterluggauer, Austin Harris, Scott Constable +2

Randomized, skewed caches (RSCs) such as CEASER-S have recently received much attention to defend against contention-based cache side channels. By randomizing and regularly changin…

cs.LO2025

Trustworthy Verification of RISC-V Binaries Using Symbolic Execution in HolBA

Karl Palmskog, Andreas Lindner, Scott Constable +2

Many types of formal verification establish properties about abstract high-level program representations, leaving a large gap to programs at runtime. Although gaps can sometimes be…

cs.CR2021

Seeds of SEED: A Side-Channel Resilient Cache Skewed by a Linear Function over a Galois Field

Scott Constable, Thomas Unterluggauer

Consider a set-associative cache with sets and ways where is prime and . Furthermore, assume that the cache may be shared among mutually distrusting prin…

cs.PL2026

Forward Symbolic Execution for Trustworthy Automation of Binary Code Verification

Andreas Lindner, Karl Palmskog, Scott Constable +3

Control flow in unstructured programs can be complex and dynamic, which makes static analysis difficult. Yet, automated reasoning about unstructured control flow is important when…

cs.CR2024

Fortify Your Foundations: Practical Privacy and Security for Foundation Model Deployments In The Cloud

Marcin Chrapek, Anjo Vahldiek-Oberwagner, Marcin Spoczynski +3

Foundation Models (FMs) display exceptional performance in tasks such as natural language processing and are being applied across a growing range of disciplines. Although typically…