The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications
Open accessAbstract
The automatic patch-based exploit generation problem is: given a program P and a patched version of the program P', automatically generate an exploit for the potentially unknown vulnerability present in P but fixed in P'. In this paper, we propose techniques for automatic patch-based exploit generation, and show that our techniques can automatically generate exploits for 5 Microsoft programs based upon patches provided via Windows Update. Although our techniques may not work in all cases, a fundamental tenant of security is to conservatively estimate the capabilities of attackers. Thus, our results indicate that automatic patch-based exploit generation should be considered practical. One important security implication of our results is that current patch distribution schemes which stagger patch distribution over long time periods, such as Windows Update, may allow attackers who receive the patch first to compromise the significant fraction of vulnerable hosts who have not yet received the patch.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
An empirical study of the reliability of UNIX utilities
Miller, B. P., Fredriksen, L., & So, B. (1990) · Communications of the ACM · doi:10.1145/96267.96279 · Cited by 1,281
Automated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
Moore, D., Paxson, V., Savage, S., Shannon, C., Staniford, S., & Weaver, N. (2003) · IEEE Security & Privacy · doi:10.1109/msecp.2003.1219056 · Cited by 973
Automated software test data generation
Korel, B. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.57624 · Cited by 971
Korat: automated testing based on Java predicates
Boyapati, C., Khurshid, S., & Marinov, D. (2002) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/566171.566191 · Cited by 593
A Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
Vigilante: end-to-end containment of internet worms
Costa, M., Crowcroft, J., Castro, M., Rowstron, A., Zhou, L., Zhang, L., & Barham, P. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095824 · Cited by 441
Towards automatic generation of vulnerability-based signatures
Brumley, D., Newsome, J., Song, D. X., Wang, H., & Jha, S. (2006) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2006.41 · Cited by 292
Self-citationVigilante: end-to-end containment of internet worms
Costa, M., Crowcroft, J., Castro, M., Rowstron, A., Zhou, L., Zhang, L., & Barham, P. (2005) · Proceedings of the twentieth ACM symposium on Operating systems principles · doi:10.1145/1095810.1095824 · Cited by 273
An empirical study of the robustness of Windows NT applications using random testing
Forrester, J. E., & Miller, B. P. (2000) · Cited by 271
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Gao, D., Reiter, M. K., & Song, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88625-9_16 · Cited by 255
Self-citationAutomatic test data generation using constraint solving techniques
Gotlieb, A., Botella, B., & Rueher, M. (1998) · Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/271771.271790 · Cited by 229
Structural Comparison of Executable Objects
Flake, H. (2004) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-2007 · Cited by 182
Automated test data generation using an iterative relaxation method
Gupta, N., Mathur, A. P., & Soffa, M. L. (1998) · Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/288195.288321 · Cited by 178
Automating Software Testing Using Program Analysis
Godefroid, P., de Halleux, P., Nori, A. V., et al. (2008) · IEEE Software · doi:10.1109/ms.2008.109 · Cited by 122
Brumley, D., Caballero, J., Liang, Z., Newsome, J., & Song, D. X. (2018) · doi:10.1184/r1/6469484 · Cited by 97
Self-citationAn empirical study of the robustness of MacOS applications using random testing
Miller, B. P., Cooksey, G., & Moore, F. (2006) · doi:10.1145/1145735.1145743 · Cited by 95
Creating Vulnerability Signatures Using Weakest Preconditions
Brumley, D., Wang, H., Jha, S., & Song, D. X. (2007) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2007.17 · Cited by 90
Self-citationAutomatic test data generation using constraint solving techniques
Arnaud Gotlieb, B., Botella, B., & Rueher, M. (1998) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/271775.271790 · Cited by 59
Automated test data generation using an iterative relaxation method
Gupta, N., Mathur, A. P., & Soffa, M. L. (1998) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/291252.288321 · Cited by 42
Cited by
GenProg: A Generic Method for Automatic Software Repair
Le Goues, C., Nguyen, T., Forrest, S., & Weimer, W. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,085
BitBlaze: A New Approach to Computer Security via Binary Analysis
Song, D., Brumley, D., Yin, H., Caballero, J., Jager, I., Kang, M. G., Liang, Z., Newsome, J., Poosankam, P., & Saxena, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89862-7_1 · Cited by 718
Self-citationAn orchestrated survey of methodologies for automated software test case generation
Anand, S., Burke, E. K., Chen, T. Y., Clark, J., Cohen, M. B., Grieskamp, W., Harman, M., Harrold, M. J., McMinn, P., Bertolino, A., et al. (2013) · Journal of Systems and Software · doi:10.1016/j.jss.2013.02.061 · Cited by 668
Before we knew it: an empirical study of zero-day attacks in the real world
Bilge, L., & Dumitraş, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382284 · Cited by 627
Unleashing Mayhem on Binary Code
Cha, S. K., Avgerinos, T., Rebert, A., & Brumley, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.31 · Cited by 518
Self-citation
Metadata
- Authors
- Brumley, D., Poosankam, P., Song, D., & Zheng, J.
- Venue
- 2008 IEEE Symposium on Security and Privacy (sp 2008)
- Publisher
- IEEE
- Published
- 2008-05
- Pages
- 143-157
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2165597437
- Cited by
- 281
- References
- 25
- FWCI
- 12.16
- 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.