The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Is finding security holes a good idea?
Abstract
Despite the large amount of effort that goes toward finding and patching security holes, the available data does not show a clear improvement in software quality as a result. This article aims to measure the effect of vulnerability finding. Any attempt to measure this kind of effect is inherently rough, depending as it does on imperfect data and several simplifying assumptions. Because I'm looking for evidence of usefulness, where possible, I bias such assumptions in favor of a positive result - explicitly calling out those assumptions biased in the opposite direction. Thus, the analysis in this article represents the best-case scenario, consistent with the data and my ability to analyze it, for the vulnerability finding's usefulness
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
R: A Language for Data Analysis and Graphics
Ihaka, R., & Gentleman, R. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474713 · Cited by 11,220
The Statistical Analysis of Series of Events
Cox, D. R., & Lewis, P. A. W. (1966) · Springer eBooks · doi:10.1007/978-94-011-7801-3 · Cited by 1,460
Jeffrey, R. C. (1965) · Defense Technical Information Center (DTIC) · Cited by 1,272
How to Own the Internet in Your Spare Time
Staniford, S., Paxson, V., & Weaver, N. C. (2002) · Cited by 1,092
S-Shaped Reliability Growth Modeling for Software Error Detection
Yamada, S., Ohba, M., & Osaki, S. (1983) · IEEE Transactions on Reliability · doi:10.1109/tr.1983.5221735 · Cited by 865
Why information security is hard - an economic perspective
Anderson, R. (2005) · Seventeenth Annual Computer Security Applications Conference · doi:10.1109/acsac.2001.991552 · Cited by 830
Code-Red: a case study on the spread and victims of an internet worm
Moore, D., Shannon, C., & claffy, K. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637244 · Cited by 787
An empirical study of operating systems errors
Chou, A., Yang, J., Chelf, B., Hallem, S., & Engler, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502042 · Cited by 713
Fishburn, P. C. (1968) · Management Science · doi:10.1287/mnsc.14.5.335 · Cited by 388
A trend analysis of exploitations
Browne, H. K., Arbaugh, W. A., McHugh, J., & Fithen, W. L. (2002) · doi:10.1109/secpri.2001.924300 · Cited by 111
Rescorla, E. K. (2003) · Cited by 107
Self-citation
Cited by
The Economics of Information Security
Anderson, R., & Moore, T. (2006) · Science · doi:10.1126/science.1130992 · Cited by 823
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
Predicting vulnerable software components
Neuhaus, S., Zimmermann, T., Holler, C., & Zeller, A. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315311 · Cited by 416
Estimating a system's mean time-to-compromise
Leversage, D. J., & Byres, E. J. (2008) · IEEE Security & Privacy · doi:10.1109/msp.2008.9 · Cited by 126
How does the offense-defense balance scale?
Garfinkel, B., & Dafoe, A. (2019) · Journal of Strategic Studies · doi:10.1080/01402390.2019.1631810 · Cited by 73
Metadata
- Authors
- Rescorla, E.
- Venue
- IEEE Security and Privacy Magazine
- Published
- 2005-01
- Volume
- 3
- Issue
- 1
- Pages
- 14-19
- ISSN
- 1540-7993 (ISSN-L)
- OpenAlex
- W2114712239
- Cited by
- 276
- References
- 11
- FWCI
- 52.22
- Type
- journal article
- 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
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.