The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Random Fill Cache Architecture
Abstract
Correctly functioning caches have been shown to leak critical secrets like encryption keys, through various types of cache side-channel attacks. This nullifies the security provided by strong encryption and allows confidentiality breaches, impersonation attacks and fake services. Hence, future cache designs must consider security, ideally without degrading performance and power efficiency. We introduce a new classification of cache side channel attacks: contention based attacks and reuse based attacks. Previous secure cache designs target only contention based attacks, and we show that they cannot defend against reuse based attacks. We show the surprising insight that the fundamental demand fetch policy of a cache is a security vulnerability that causes the success of reuse based attacks. We propose a novel random fill cache architecture that replaces demand fetch with random cache fill within a configurable neighborhood window. We show that our random fill cache does not degrade performance, and in fact, improves the performance for some types of applications. We also show that it provides information-theoretic security against reuse based attacks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Binkert, N., Beckmann, B., Black, G., Reinhardt, S. K., Saidi, A., Basu, A., Hestness, J., Hower, D. R., Krishna, T., Sardashti, S., et al. (2011) · ACM SIGARCH Computer Architecture News · doi:10.1145/2024716.2024718 · Cited by 4,930
Cited by
Flush+Flush: A Fast and Stealthy Cache Attack
Gruss, D., Maurice, C., Wagner, K., & Mangard, S. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-40667-1_14 · Cited by 569
CATalyst: Defeating last-level cache side channel attacks in cloud computing
Liu, F., Ge, Q., Yarom, Y., Mckeen, F., Rozas, C., Heiser, G., & Lee, R. B. (2016) · 2016 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2016.7446082 · Cited by 370
Self-citationA survey of microarchitectural timing attacks and countermeasures on contemporary hardware
Ge, Q., Yarom, Y., Cock, D., & Heiser, G. (2018) · Journal of Cryptographic Engineering · doi:10.1007/s13389-016-0141-6 · Cited by 368
SgxPectre: Stealing Intel Secrets from SGX Enclaves Via Speculative Execution
Chen, G., Chen, S., Xiao, Y., Zhang, Y., Lin, Z., & Lai, T. H. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00020 · Cited by 319
Cache Template Attacks: Automating Attacks On Inclusive Last-Level Caches
Gruss, D., Spreitzer, R., & Mangard, S. (2015) · INFM-OAR (INFN Catania) · doi:10.5281/zenodo.55454 · Cited by 317
A Formal Foundation for Secure Remote Execution of Enclaves
Subramanyan, P., Sinha, R., Lebedev, I., Devadas, S., & Seshia, S. A. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134098 · Cited by 119
Multi-dimensional analysis of embedded systems security
Elmiligi, H., Gebali, F., & El-Kharashi, M. W. (2016) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2015.12.005 · Cited by 22
Metadata
- Authors
- Liu, F., & Lee, R. B.
- Venue
- 2014 47th Annual IEEE/ACM International Symposium on Microarchitecture
- Publisher
- IEEE
- Published
- 2014-12
- Pages
- 203-215
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2137453738
- Cited by
- 212
- References
- 1
- FWCI
- 7.51
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.