SEED的种子：一种基于Galois域上线性函数的侧通道弹性Cache
Seeds of SEED: A Side-Channel Resilient Cache Skewed by a Linear Function over a Galois Field
摘要：
考虑具有$p^n$集和$p^n$路的集关联高速缓存，其中$p$是素数，而$n>0$是素数。此外，假设高速缓存可以在$p^n$之间共享，这些主体相互不信任，可以使用Prime+Probe侧信道攻击来攻击彼此;在架构上，这些主体占用单独的安全域（例如，单独的进程、虚拟机、沙箱等）。本文证明了在Galois域$G_{p^n}$上存在一个线性偏斜的缓存集，它具有以下性质：每个安全域的每个缓存集与每个其他安全域的每个缓存集恰好相交一次.因此，从安全域$A$中的单个高速缓存集合的随机逐出可以经由安全域$B$的高速缓存集合中的任何一个中的Prime+Probe来观察。本文描述了这种线性偏斜的特点，并介绍了如何可以有效地实现在硬件中。
英文摘要：
Consider a set-associative cache with $p^n$ sets and $p^n$ ways where $p$ is prime and $n>0$. Furthermore, assume that the cache may be shared among $p^n$ mutually distrusting principals that may use the Prime+Probe side-channel attack against one another; architecturally, these principals occupy separate security domains (for example, separate processes, virtual machines, sandboxes, etc.). This paper shows that there exists a linear skewing of cache sets over the Galois field $G_{p^n}$ that exhibits the following property: each cache set of each security domain intersects every cache set of every other security domain exactly once. Therefore, a random eviction from a single cache set in security domain $A$ may be observed via Prime+Probe in any of security domain $B$'s cache sets. This paper characterizes this linear skewing and describes how it can be implemented efficiently in hardware.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
