Name
Abstract | ||
|---|---|---|
Storage channels can be provably eliminated in well-designed, high-assurance kernels. Timing channels remain the last mile for confidentiality and are still beyond the reach of formal analysis, so must be dealt with empirically. We perform such an analysis, collecting a large data set (2,000 hours of observations) for two representative timing channels, the locally-exploitable cache channel and a remote exploit of OpenSSL execution timing, on the verified seL4 microkernel. We also evaluate the effectiveness, in bandwidth reduction, of a number of black-box mitigation techniques (cache colouring, instruction-based scheduling and deterministic delivery of server responses) across a number of hardware platforms. Our (somewhat unexpected) results show that while these defences were highly effective a few processor generations ago, the trend towards imprecise events in modern microarchitectures weakens the defences and introduces new channels. This demonstrates the necessity of careful empirical analysis of timing channels. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2660267.2660294 | ACM Conference on Computer and Communications Security |
Keywords | Field | DocType |
information flow controls,measurement,performance,security | Last mile,Scheduling (computing),Computer security,Computer science,Cache,Microkernel,Communication channel,Exploit,Bandwidth (signal processing),Empirical research | Conference |
Citations | PageRank | References |
28 | 0.93 | 35 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Cock | 1 | 827 | 37.44 |
| Qian Ge | 2 | 315 | 9.40 |
| Toby Murray | 3 | 242 | 17.03 |
| Gernot Heiser | 4 | 2525 | 137.42 |