The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
SoK: Eternal War in Memory
Open accessAbstract
Memory corruption bugs in software written in low-level languages like C or C++ are one of the oldest problems in computer security. The lack of safety in these languages allows attackers to alter the program's behavior or take full control over it by hijacking its control flow. This problem has existed for more than 30 years and a vast number of potential solutions have been proposed, yet memory corruption attacks continue to pose a serious threat. Real world exploits show that all currently deployed protections can be defeated. This paper sheds light on the primary reasons for this by describing attacks that succeed on today's systems. We systematize the current knowledge about various protection techniques by setting up a general model for memory corruption attacks. Using this model we show what policies can stop which attacks. The model identifies weaknesses of currently deployed techniques, as well as other proposed protections enforcing stricter policies. We analyze the reasons why protection mechanisms implementing stricter polices are not deployed. To achieve wide adoption, protection mechanisms must support a multitude of features and must satisfy a host of requirements. Especially important is performance, as experience shows that only solutions whose overhead is in reasonable bounds get deployed. A comparison of different enforceable policies helps designers of new protection mechanisms in finding the balance between effectiveness (security) and efficiency. We identify some open research problems, and provide suggestions on improving the adoption of newer techniques.
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
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065034 · Cited by 3,180
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
Valgrind: a framework for heavyweight dynamic binary instrumentation
Nethercote, N., & Seward, J. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250746 · Cited by 2,244
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86)
Shacham, H. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315313 · Cited by 1,280
StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks
Cowan, C., Pu, C., Maier, D., Hintony, H., Walpole, J., Bakke, P., Beattie, S., Grier, A., Wagle, P., & Zhang, Q. (1998) · PDXScholar (Portland State University) · Cited by 1,278
Efficient software-based fault isolation
Wahbe, R., Lucco, S., Anderson, T. E., & Graham, S. L. (1993) · Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93 · doi:10.1145/168619.168635 · Cited by 1,214
Abadi, M., Budiu, M., Erlingsson, Ú., & Ligatti, J. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102165 · Cited by 1,032
Jim, T., Morrisett, J. G., Grossman, D., Hicks, M., Cheney, J., & Wang, Y.-L. (2002) · USENIX Annual Technical Conference · Cited by 866
On the effectiveness of address-space randomization
Shacham, H., Page, M., Pfaff, B., Goh, E.-J., Modadugu, N., & Boneh, D. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030124 · Cited by 861
Smashing The Stack For Fun And Profit
One, A. (1996) · Medical Entomology and Zoology · Cited by 769
AddressSanitizer: a fast address sanity checker
Serebryany, K., Bruening, D. L., Potapenko, A., & Vyukov, D. (2012) · USENIX Annual Technical Conference · Cited by 724
Countering code-injection attacks with instruction-set randomization
Kc, G. S., Keromytis, A. D., & Prevelakis, V. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948146 · Cited by 646
Jump-oriented programming: a new class of code-reuse attack
Bletsch, T., Jiang, X., Freeh, V. W., & Liang, Z. (2011) · Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/1966913.1966919 · Cited by 553
Native Client: A Sandbox for Portable, Untrusted x86 Native Code
Yee, B., Sehr, D., Dardyk, G., Chen, J. B., Muth, R., Ormandy, T., Okasaka, S., Narula, N., & Fullagar, N. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.25 · Cited by 549
Return-oriented programming without returns
Checkoway, S., Davi, L., Dmitrienko, A., Sadeghi, A.-R., Shacham, H., & Winandy, M. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866370 · Cited by 530
SoftBound: highly compatible and complete spatial memory safety for c
Nagarakatte, S., Zhao, J., Martin, M. M. K., & Zdancewic, S. (2009) · Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1542476.1542504 · Cited by 521
Non-control-data attacks are realistic threats
Chen, S., Xu, J., Sezer, E. C., Gauriar, P., & Iyer, R. K. (2005) · Cited by 509
Necula, G. C., McPeak, S., & Weimer, W. R. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442786 · Cited by 502
Return-Oriented Programming: Systems, Languages, and Applications
Roemer, R., Buchanan, E., Shacham, H., & Savage, S. (2012) · ACM Transactions on Information and System Security · doi:10.1145/2133375.2133377 · Cited by 497
DieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134000 · Cited by 405
HyperSafe: A Lightweight Approach to Provide Lifetime Hypervisor Control-Flow Integrity
Wang, Z., & Jiang, X. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.30 · Cited by 403
Necula, G. C., McPeak, S., & Weimer, W. R. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503286 · Cited by 375
PointGuard TM : Protecting pointers from buffer overflow vulnerabilities
Cowan, C., Beattie, S., Johansen, J., et al. (2003) · Cited by 346
XFI: software guards for system address spaces
Erlingsson, Ú., Abadi, M., Vrable, M., Budiu, M., & Necula, G. C. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298463 · Cited by 332
Binary stirring: self-randomizing instruction addresses of legacy x86 binary code
Wartell, R., Mohan, V., Hamlen, K. W., & Lin, Z. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382216 · Cited by 323
Smashing the Gadgets: Hindering Return-Oriented Programming Using In-place Code Randomization
Pappas, V., Polychronakis, M., & Keromytis, A. D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.41 · Cited by 322
Nagarakatte, S., Zhao, J., Martin, M. M. K., & Zdancewic, S. (2010) · International Symposium on Memory Management · doi:10.1145/1806651.1806657 · Cited by 315
Hiser, J., Nguyen-Tuong, A., Co, M., Hall, M., & Davidson, J. W. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.39 · Cited by 256
Control-Flow Integrity: Precision, Security, and Performance
Burow, N., Carr, S. A., Nash, J., Larsen, P., Franz, M., Brunthaler, S., & Payer, M. (2018) · ACM Computing Surveys · doi:10.1145/3054924 · Cited by 254
Self-citationAddress Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Kil, C., Jun, J., Bookholt, C., Xu, J., & Ning, P. (2006) · 2006 22nd Annual Computer Security Applications Conference (ACSAC'06) · doi:10.1109/acsac.2006.9 · Cited by 250
Novark, G., & Berger, E. D. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866371 · Cited by 204
Q: Exploit Hardening Made Easy
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2018) · doi:10.1184/r1/6469187 · Cited by 178
Spradling, C. D. (2007) · ACM SIGARCH Computer Architecture News · doi:10.1145/1241601.1241625 · Cited by 169
Automatic pool allocation: improving performance by controlling data structure layout in the heap
Lattner, C., & Adve, V. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065027 · Cited by 158
Memory Errors: The Past, the Present, and the Future
van der Veen, V., dutt-Sharma, N., Cavallaro, L., & Bos, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33338-5_5 · Cited by 157
Yee, B., Sehr, D. C., Dardyk, G., Chen, J. B., Muth, R., Ormandy, T., Okasaka, S., Narula, N., & Fullagar, N. (2009) · Communications of the ACM · doi:10.1145/1629175.1629203 · Cited by 157
On the Expressiveness of Return-into-libc Attacks
Tran, M., Etheridge, M., Bletsch, T. K., Jiang, X., Freeh, V. W., & Ning, P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23644-0_7 · Cited by 148
Minemu: The World’s Fastest Taint Tracker
Bosman, E., Slowinska, A., & Bos, H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23644-0_1 · Cited by 109
kGuard: Lightweight Kernel Protection against Return-to-user Attacks
Kemerlis, V. P., Portokalidis, G., & Keromytis, A. D. (n.d.) · Cited by 103
Runtime countermeasures for code injection attacks against C and C++ programs
Younan, Y., Joosen, W., & Piessens, F. (2012) · ACM Computing Surveys · doi:10.1145/2187671.2187679 · Cited by 65
Comprehensive and Efficient Protection of Kernel Control Data
Li, J., Wang, Z., Bletsch, T. K., et al. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2159712 · Cited by 46
Cited by
SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis
Shoshitaishvili, Y., Wang, R., Salls, C., Stephens, N., Polino, M., Dutcher, A., Grosen, J., Feng, S., Hauser, C., Kruegel, C., et al. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.17 · Cited by 957
VC3: Trustworthy Data Analytics in the Cloud Using SGX
Schuster, F., Costa, M., Fournet, C., Gkantsidis, C., Peinado, M., Mainar-Ruiz, G., & Russinovich, M. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.10 · Cited by 595
Schuster, F., Tendyck, T., Liebchen, C., Davi, L., Sadeghi, A.-R., & Holz, T. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.51 · Cited by 353
Zhu, X., Wen, S., Camtepe, S., & Xiang, Y. (2022) · ACM Computing Surveys · doi:10.1145/3512345 · Cited by 334
SoK: Automated Software Diversity
Larsen, P., Homescu, A., Brunthaler, S., & Franz, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.25 · Cited by 321
Metadata
- Authors
- Szekeres, L., Payer, M., Wei, T., & Song, D.
- Venue
- 2013 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 48-62
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2117798902
- Cited by
- 664
- References
- 42
- FWCI
- 24.28
- Type
- conference paper
- 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.