The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Smashing the Gadgets: Hindering Return-Oriented Programming Using In-place Code Randomization
Open accessAbstract
The wide adoption of non-executable page protections in recent versions of popular operating systems has given rise to attacks that employ return-oriented programming (ROP) to achieve arbitrary code execution without the injection of any code. Existing defenses against ROP exploits either require source code or symbolic debugging information, or impose a significant runtime overhead, which limits their applicability for the protection of third-party applications. In this paper we present in-place code randomization, a practical mitigation technique against ROP attacks that can be applied directly on third-party software. Our method uses various narrow-scope code transformations that can be applied statically, without changing the location of basic blocks, allowing the safe randomization of stripped binaries even with partial disassembly coverage. These transformations effectively eliminate about 10%, and probabilistically break about 80% of the useful instruction sequences found in a large set of PE files. Since no additional code is inserted, in-place code randomization does not incur any measurable runtime overhead, enabling it to be easily used in tandem with existing exploit mitigations such as address space layout randomization. Our evaluation using publicly available ROP exploits and two ROP code generation toolkits demonstrates that our technique prevents the exploitation of the tested vulnerable Windows 7 applications, including Adobe Reader, as well as the automated construction of alternative ROP payloads that aim to circumvent in-place code randomization using solely any remaining unaffected instruction sequences.
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
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
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
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
The art of computer virus research and defense
(2005) · Choice Reviews Online · doi:10.5860/choice.43-1613 · Cited by 836
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
Self-citationJump-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
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
Address obfuscation: an efficient approach to combat a board range of memory error exploits
Bhatkar, S., DuVarney, D. C., & Sekar, R. (2003) · USENIX Security Symposium · Cited by 509
Building diverse computer systems
Forrest, S., Somayaji, A., & Ackley, D. H. (2002) · Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133) · doi:10.1109/hotos.1997.595185 · Cited by 491
Compilers: Principles, Techniques, and Tools (2nd Edition)
Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2006) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 387
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
Large-scale malware indexing using function-call graphs
Hu, X., Chiueh, T.-C., & Shin, K. G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653736 · Cited by 312
Efficient techniques for comprehensive protection from memory error exploits
Bhatkar, S., Sekar, R., & DuVarney, D. C. (2005) · Cited by 298
Operating system protection through program evolution
Cohen, F. B. (1993) · Computers & Security · doi:10.1016/0167-4048(93)90054-9 · Cited by 290
Static disassembly of obfuscated binaries
Kruegel, C., Robertson, W., Valeur, F., & Vigna, G. (2004) · Cited by 279
Address 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
Return-oriented rootkits: bypassing kernel code integrity protection mechanisms
Hund, R., Holz, T., & Freiling, F. (2009) · Cited by 215
Q: Exploit Hardening Made Easy
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2018) · doi:10.1184/r1/6469187 · Cited by 178
DROP: Detecting Return-Oriented Programming Malicious Code
Chen, P., Xiao, H., Shen, X., Yin, X., Mao, B., & Li, X. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10772-6_13 · Cited by 169
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
Davi, L., Sadeghi, A., & Winandy, M. (2009) · Scalable Trusted Computing · doi:10.1145/1655108.1655117 · Cited by 151
Efficient fine-grained binary instrumentationwith applications to taint-tracking
Saxena, P., Sekar, R., & Puranik, V. (2008) · IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1145/1356058.1356069 · Cited by 72
Cited by
Szekeres, L., Payer, M., Wei, T., & Song, D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.13 · Cited by 664
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
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
Metadata
- Authors
- Pappas, V., Polychronakis, M., & Keromytis, A. D.
- Venue
- 2012 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2012-05
- Pages
- 601-615
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2009801020
- Cited by
- 322
- References
- 23
- FWCI
- 30.04
- Type
- conference paper
- Language
- en
- Open access
- green
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.