The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Cache Games -- Bringing Access-Based Cache Attacks on AES to Practice
Abstract
Side channel attacks on cryptographic systems exploit information gained from physical implementations rather than theoretical weaknesses of a scheme. In recent years, major achievements were made for the class of so called access-driven cache attacks. Such attacks exploit the leakage of the memory locations accessed by a victim process. In this paper we consider the AES block cipher and present an attack which is capable of recovering the full secret key in almost real time for AES-128, requiring only a very limited number of observed encryptions. Unlike previous attacks, we do not require any information about the plaintext (such as its distribution, etc.). Moreover, for the first time, we also show how the plaintext can be recovered without having access to the cipher text at all. It is the first working attack on AES implementations using compressed tables. There, no efficient techniques to identify the beginning of AES rounds is known, which is the fundamental assumption underlying previous attacks. We have a fully working implementation of our attack which is able to recover AES keys after observing as little as 100 encryptions. It works against the OpenS SL 0.9.8n implementation of AES on Linux systems. Our spy process does not require any special privileges beyond those of a standard Linux user. A contribution of probably independent interest is a denial of service attack on the task scheduler of current Linux systems (CFS), which allows one to observe (on average) every single memory access of a victim process.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
Bayes, T. (1763) · Philosophical Transactions of the Royal Society of London · doi:10.1098/rstl.1763.0053 · Cited by 2,995
AN ESSAY TOWARDS SOLVING A PROBLEM IN THE DOCTRINE OF CHANCES
BAYES (1958) · Biometrika · doi:10.1093/biomet/45.3-4.296 · Cited by 2,911
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Best practices for convolutional neural networks applied to visual document analysis
Simard, P. Y., Steinkraus, D., & Platt, J. C. (2005) · Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings. · doi:10.1109/icdar.2003.1227801 · Cited by 2,741
Bernardo, J. M., & Smith, A. F. M. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316870 · Cited by 2,178
Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds
Ristenpart, T., Tromer, E., Shacham, H., & Savage, S. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653687 · Cited by 2,053
Cited by
Spectre Attacks: Exploiting Speculative Execution
Kocher, P., Genkin, D., Gruss, D., Haas, W., Hamburg, M., Lipp, M., Mangard, S., Prescher, T., Schwarz, M., & Yarom, Y. (2018) · arXiv · doi:10.48550/arxiv.1801.01203 · Cited by 1,850
Spectre Attacks: Exploiting Speculative Execution
Kocher, P., Horn, J., Fogh, A., Genkin, D., Gruss, D., Haas, W., Hamburg, M., Lipp, M., Mangard, S., Prescher, T., et al. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00002 · Cited by 1,780
Last-Level Cache Side-Channel Attacks are Practical
Liu, F., Yarom, Y., Ge, Q., Heiser, G., & Lee, R. B. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.43 · Cited by 1,009
Cross-VM side channels and their use to extract private keys
Zhang, Y., Juels, A., Reiter, M. K., & Ristenpart, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382230 · Cited by 787
Controlled-Channel Attacks: Deterministic Side Channels for Untrusted Operating Systems
Xu, Y., Cui, W., & Peinado, M. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.45 · Cited by 713
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
Practical Timing Side Channel Attacks against Kernel Space ASLR
Hund, R., Willems, C., & Holz, T. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.23 · Cited by 393
Rowhammer.js: A Remote Software-Induced Fault Attack in JavaScript
Gruss, D., Maurice, C., & Mangard, S. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-40667-1_15 · Cited by 373
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
Irazoqui, G., Eisenbarth, T., & Sunar, B. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.42 · Cited by 336
Cross-Tenant Side-Channel Attacks in PaaS Clouds
Zhang, Y., Juels, A., Reiter, M. K., & Ristenpart, T. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660356 · Cited by 327
Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel Hazards in SGX
Wang, W., Chen, G., Pan, X., Zhang, Y., Wang, X., Bindschaedler, V., Tang, H., & Gunter, C. A. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134038 · Cited by 320
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
RIDL: Rogue In-Flight Data Load
van Schaik, S., Milburn, A., Osterlund, S., Frigo, P., Maisuradze, G., Razavi, K., Bos, H., & Giuffrida, C. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00087 · Cited by 310
Spectre attacks: exploiting speculative execution
Kocher, P., Horn, J., Fogh, A., Genkin, D., Gruss, D., Haas, W., Hamburg, M., Lipp, M., Mangard, S., Prescher, T., et al. (2020) · Communications of the ACM · doi:10.1145/3399742 · Cited by 281
Wait a Minute! A fast, Cross-VM Attack on AES
Irazoqui, G., Inci, M. S., Eisenbarth, T., & Sunar, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11379-1_15 · Cited by 258
CacheZoom: How SGX Amplifies the Power of Cache Attacks
Moghimi, A., Irazoqui, G., & Eisenbarth, T. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-66787-4_4 · Cited by 237
Security Vulnerabilities of SGX and Countermeasures: A Survey
Fei, S., Yan, Z., Ding, W., & Xie, H. (2022) · ACM Computing Surveys · doi:10.1145/3456631 · Cited by 122
Pseudo Constant Time Implementations of TLS Are Only Pseudo Secure
Ronen, E., Paterson, K. G., & Shamir, A. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243775 · Cited by 21
Metadata
- Authors
- Gullasch, D., Bangerter, E., & Krenn, S.
- Venue
- 2011 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 490-505
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2172060328
- Cited by
- 528
- References
- 33
- FWCI
- 18.59
- 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.