The DOI matches its Crossref record; 24 of the 26 references it cites were found in a registry or an index.
Secure audit logs to support computer forensics
Open accessAbstract
In many real-world applications, sensitive information must be kept it log files on an untrusted machine. In the event that an attacker captures this machine, we would like to guarantee that he will gain little or no information from the log files and to limit his ability to corrupt the log files. We describe a computationally cheap method for making all log entries generated prior to the logging machine's compromise impossible for the attacker to read, and also impossible to modify or destroy undetectably.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Key-evolution schemes (Schneier and Kelsey, 1999) chain successive log entries through evolving cryptographic keys, providing forward integrity but requiring careful key management and offering only sequential verification.”
From Lightweight Tamper-Evident Log Integrity Verification for IoT Edge Environments: A Merkle Tree Pipeline with Adaptive Chunking (2026) · cites this paper as Schneier and Kelsey, 1999
Experimental — accuracy not yet measured
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_1 · Cited by 1,637
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_2 · Cited by 1,611
Authentication and authenticated key exchanges
Diffie, W., van Oorschot, P. C., & Wiener, M. J. (1992) · Designs Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,147
Tamper resistance: a cautionary note
Anderson, R., & Kühn, M. (1996) · Cited by 902
Description of a new variable-length key, 64-bit block cipher (Blowfish)
Schneier, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58108-1_24 · Cited by 808
Self-citation
Research works printed but not linked: 11
- ANDERSON R., 1996, Proceedings of the 2nd USENIX Workshop on Electronic Commerce (Nov.). USENIX Assoc., 1
- DOBBERTIN H., 1996, Proceedings of the 3rd International Workshop on Fast Software Encryption. Springer-Verlag, 71
- KELSEY J., 1996, Proceedings of the 1996 CARDIS (Sept.). 11-24
- KELSEY J., 1996, Proceedings of the 12th Annual Conference on Computer Security Applications. IEEE Computer Society Press, 24
- KELSEY J., 1998, Proceedings of the 1997 Workshop on Protocols. Springer-Verlag, 91
- LAI X., Advances in Cryptology (CRYPTO '91)
- MCCORMAC J. 1996. European Scrambling Systems. Waterford University Press.]] MCCORMAC J. 1996. European Scrambling Systems. Waterford University Press.]]
- SCHNEIER B., 1994, Proceedings of the Cambridge Security Workshop. Springer-Verlag, 191
- SCHNEIER B. 1995. Applied cryptography (2nd ed.): protocols algorithms and source code in C. 2ND John Wiley & Sons Inc. New York NY.]] SCHNEIER B. 1995. Applied cryptography (2nd ed.): protocols algorithms and source code in C. 2ND John Wiley & Sons Inc. New York NY.]]
- SCHNEIER B., 1998, Proceedings of the 7th on USENIX Security Symposium (Jan.). USENIX Assoc., 53
- WILDING E., 1997, Computer forensics: Trends and concerns, Inf. Sec. Bull., 2, 6
Cited by
Sorted by citations
Thakkar, A., & Lohiya, R. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-10037-9 · Cited by 394
Building an Encrypted and Searchable Audit Log.
Waters, B. R., Balfanz, D., Durfee, G., & Smetters, D. K. (2004) · Cited by 372
Block-DEF: A secure digital evidence framework using blockchain
Tian, Z., Li, M., Qiu, M., Sun, Y., & Su, S. (2019) · Information Sciences · doi:10.1016/j.ins.2019.04.011 · Cited by 366
Vanish: increasing data privacy with self-destructing data
Geambasu, R., Kohno, T., Levy, A. A., & Levy, H. M. (2009) · Cited by 344
Privacy and Data Protection by Design - from policy to engineeringPreprint
Danezis, G., Domingo‐Ferrer, J., Hansen, M., Hoepman, J.-H., Métayer, D. L., Tirtea, R., & Schiffner, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.03726 · Cited by 307
Metadata
- Authors
- Schneier, B., & Kelsey, J.
- Affiliations
- University of Minnesota (US)
- Venue
- ACM Transactions on Information and System Security
- Published
- 1999-05
- Volume
- 2
- Issue
- 2
- Pages
- 159-176
- ISSN
- 1094-9224 (ISSN-L)
- 1557-7406
- OpenAlex
- W1987593503
- Cited by
- 443
- References
- 26
- Citations by year
- 2026: 38 · 2025: 7 · 2024: 5 · 2023: 11 · 2022: 5 · 2021: 10 · 2020: 18 · 2019: 23 · 2018: 22 · 2017: 19 · 2016: 10 · 2015: 30 · 2014: 29 · 2013: 23 · 2012: 21
- FWCI
- 3.73
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Transactions on Information and System Security (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Physical Sciences › Computer Science › Information Systems › Digital and Cyber Forensics
- Keywords
- audit logs, log integrity, digital forensics, secure logging
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
