The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Non-monopolizable caches: Low-complexity mitigation of cache side channel attacks
Open accessAbstract
We propose a flexibly-partitioned cache design that either drastically weakens or completely eliminates cache-based side channel attacks. The proposed Non-Monopolizable (NoMo) cache dynamically reserves cache lines for active threads and prevents other co-executing threads from evicting reserved lines. Unreserved lines remain available for dynamic sharing among threads. NoMo requires only simple modifications to the cache replacement logic, making it straightforward to adopt. It requires no software support enabling it to automatically protect pre-existing binaries. NoMo results in performance degradation of about 1% on average. We demonstrate that NoMo can provide strong security guarantees for the AES and Blowfish encryption algorithms.
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
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 2×
“The strength of modern cryptography makes it infeasible for the attackers to uncover the secret keys using brute-force trials, differential analysis [Biham and Shamir 1991] or linear cryptanalysis [Matsui 1994].”
Background
Cited by
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
A 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
“Hardware solutions [12, 15, 47, 49, 78, 79] require modification of the processors, which are typically effective, but are limited in that the time window required to have major processor vendors to incorporate them in commercial hardware is very long.”
BackgroundA survey on the (in)security of trusted execution environments
Muñoz, A., Ríos, R., Román, R., & López, J. (2023) · Computers & Security · doi:10.1016/j.cose.2023.103180 · Cited by 131
“However, we should be aware that state partitioning in the kernel will only be possible with additional hardware support as Ma˜na and Mu˜noz described in 2006 (Ma˜na and Mu˜noz, 2006) and Dominster et al. in 2012 (Domnitser et al., 2012).”
MethodA 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
Metadata
- Authors
- Domnitser, L., Jaleel, A., Loew, J., Abu-Ghazaleh, N., & Ponomarev, D.
- Venue
- ACM Transactions on Architecture and Code Optimization
- Published
- 2012-01
- Volume
- 8
- Issue
- 4
- Pages
- 1-21
- ISSN
- 1544-3566 (ISSN-L)
- 1544-3973
- OpenAlex
- W2025539306
- Cited by
- 197
- References
- 2
- FWCI
- 6.33
- Type
- journal article
- Language
- en
- Open access
- bronze
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.