The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Out of Control: Overcoming Control-Flow Integrity
Open accessAbstract
As existing defenses like ASLR, DEP, and stack cookies are not sufficient to stop determined attackers from exploiting our software, interest in Control Flow Integrity (CFI) is growing. In its ideal form, CFI prevents flows of control that were not intended by the original program, effectively putting a stop to exploitation based on return oriented programming (and many other attacks besides). Two main problems have prevented CFI from being deployed in practice. First, many CFI implementations require source code or debug information that is typically not available for commercial software. Second, in its ideal form, the technique is very expensive. It is for this reason that current research efforts focus on making CFI fast and practical. Specifically, much of the work on practical CFI is applicable to binaries, and improves performance by enforcing a looser notion of control flow integrity. In this paper, we examine the security implications of such looser notions of CFI: are they still able to prevent code reuse attacks, and if not, how hard is it to bypass its protection? Specifically, we show that with two new types of gadgets, return oriented programming is still possible. We assess the availability of our gadget sets, and demonstrate the practicality of these results with a practical exploit against Internet Explorer that bypasses modern CFI implementations.
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
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
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
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
Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization
Snow, K. Z., Monrose, F., Davi, L., Dmitrienko, A., Liebchen, C., & Sadeghi, A. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.45 · Cited by 505
Practical Control Flow Integrity and Randomization for Binary Executables
Zhang, C., Wei, T., Chen, Z., Duan, L., Szekeres, L., McCamant, S., Song, D., & Zou, W. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.44 · Cited by 482
Control flow integrity for COTS binaries
Zhang, M., & Sekar, R. (2013) · Cited by 409
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
When good instructions go bad: generalizing return-oriented programming to RISC
Buchanan, E., Roemer, R., Shacham, H., & Savage, S. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455776 · Cited by 362
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
Transparent ROP exploit mitigation using indirect branch tracing
Pappas, V., Polychronakis, M., & Keromytis, A. D. (2013) · USENIX Security Symposium · Cited by 274
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
StackGhost: Hardware Facilitated Stack Protection
Frantzen, M., & Shuey, M. (2001) · Cited by 202
Adapting software fault isolation to contemporary CPU architectures
Sehr, D. C., Muth, R., Biffle, C. L., Khimenko, V., Pasko, E., Schimpf, K., Yee, B., & Chen, B. (2010) · Cited by 176
Defeating return-oriented rootkits with " Return-Less " kernels
Li, J., Wang, Z., Jiang, X., Grace, M. C., & Bahram, S. (2010) · European Conference on Computer Systems · doi:10.1145/1755913.1755934 · Cited by 160
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
MoCFI: A Framework to Mitigate Control-Flow Attacks on Smartphones
Davi, L., Dmitrienko, A., Egele, M., Fischer, T., Holz, T., Hund, R., Nürnberger, S., & Sadeghi, A. (2012) · Cited by 153
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
Combining control-flow integrity and static analysis for efficient and validated data sandboxing
Zeng, B., Tan, G., & Morrisett, G. (2011) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2046707.2046713 · Cited by 108
Schwartz, E. J., Lee, J., Woo, M., et al. (2013) · USENIX Security Symposium · Cited by 99
Pewny, J., & Holz, T. (2013) · Annual Computer Security Applications Conference · doi:10.1145/2523649.2523674 · Cited by 46
Schwartz, E. J., Lee, J., Woo, M., & Brumley, D. (2018) · Figshare · doi:10.1184/r1/6469064 · Cited by 26
Cited by
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
The Cybersecurity Landscape in Industrial Control Systems
McLaughlin, S., Konstantinou, C., Wang, X., Davi, L., Sadeghi, A.-R., Maniatakos, M., & Karri, R. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2512235 · Cited by 391
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
Kuznetsov, V., Szekeres, L., Payer, M., Candea, G., Sekar, R., & Song, D. X. (2014) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/2685048.2685061 · Cited by 311
A Survey on Systems Security Metrics
Pendleton, M., Garcia-Lebron, R., Cho, J.-H., & Xu, S. (2017) · ACM Computing Surveys · doi:10.1145/3005714 · Cited by 283
Metadata
- Authors
- Goktas, E., Athanasopoulos, E., Bos, H., & Portokalidis, G.
- Venue
- 2014 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 575-589
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2022292029
- Cited by
- 361
- References
- 28
- FWCI
- 33.01
- 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.