The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Jump-oriented programming: a new class of code-reuse attack
Abstract
Return-oriented programming is an effective code-reuse attack in which short code sequences ending in a ret instruction are found within existing binaries and executed in arbitrary order by taking control of the stack. This allows for Turing-complete behavior in the target program without the need for injecting attack code, thus significantly negating current code injection defense efforts (e.g., W⊕X). On the other hand, its inherent characteristics, such as the reliance on the stack and the consecutive execution of return-oriented gadgets, have prompted a variety of defenses to detect or prevent it from happening.
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
The 26th USENIX Security Symposium 2017
Αλεξόπουλος, Ν., Kiayias, A., Zacharias, T., & Talviste, R. (2017) · USENIX Security Symposium · Cited by 1,168
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
Smashing The Stack For Fun And Profit
One, A. (1996) · Medical Entomology and Zoology · Cited by 769
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
Secure Execution Via Program Shepherding
Kiriansky, V., Bruening, D. L., & Amarasinghe, S. P. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 532
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
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
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
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
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
C-FLAT: Control-Flow Attestation for Embedded Systems Software
Abera, T., Asokan, N., Davi, L., Ekberg, J.-E., Nyman, T., Paverd, A., Sadeghi, A.-R., & Tsudik, G. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978358 · Cited by 258
Metadata
- Authors
- Bletsch, T., Jiang, X., Freeh, V. W., & Liang, Z.
- Venue
- Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
- Publisher
- ACM
- Published
- 2011-03-22
- Pages
- 30-40
- OpenAlex
- W1969501726
- Cited by
- 553
- References
- 19
- FWCI
- 19.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Jump-oriented programming: a new class of code-reuse attack. https://app.cochat.ai/papers/10.1145/1966913.1966919
- The paper
- Bletsch, T., Jiang, X., Freeh, V. W., & Liang, Z. (2011). Jump-oriented programming: a new class of code-reuse attack. Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security. https://doi.org/10.1145/1966913.1966919
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.