How to time-stamp a digital document
Open accessThe 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
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 integrity of transactions is guaranteed by digital signatures, and the immutability of the chain is guaranteed by hash functions.
“The integrity of the transactions is guaranteed by digital signatures because every transaction is signed by the sender, and the immutability of the chain is guaranteed by hash functions24.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [24]
Section 5.1 (page not specified) describes collision-free hashes linking signed time-stamp certificates, supporting the claim that hashes help protect a chain against alteration. Section 4.2 describes the time-stamping service signing a document hash and time, not every transaction being signed by its sender. The paper therefore does not support the transaction-specific part of the claim. (LLM, conf=0.88)
Experimental — accuracy not yet measuredThe immutability of transactions stored in blockchain networks is guaranteed because it is impossible to tamper with the ledger without being detected.
“The immutability of the transactions stored in blockchain networks is guaranteed because it is impossible to tamper with the ledger without being detected.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [24]
The Introduction says the aim is to make changes to a time-stamped digital document apparent, and §5.1 describes linked certificates that a challenger can verify. But the paper addresses digital documents and time-stamps, not transactions in blockchain ledgers. Its security claims also depend on cryptographic assumptions, rather than an unconditional guarantee that tampering is impossible. (LLM, conf=0.88)
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.
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S. M., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,803 · see citing works
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686 · see citing works
Goldwasser, S., & Micali, S. M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,667 · see citing works
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. M. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,309 · see citing works
A Design Principle for Hash Functions
Damgård, I. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_39 · Cited by 1,192 · see citing works
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,011 · see citing works
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73011 · Cited by 960 · see citing works
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34805-0_40 · Cited by 880 · see citing works
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. G. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73009 · Cited by 732 · see citing works
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100269 · Cited by 698 · see citing works
Secrecy, authentication, and public key systems
Merkle, R. C. (1979) · Cited by 501 · see citing works
The MD4 Message Digest Algorithm
Rivest, R. L. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_22 · Cited by 487 · see citing works
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462 · see citing works
Collision Free Hash Functions and Public Key Signature Schemes
Damgård, I. (2010) · Lecture notes in computer science · doi:10.1007/3-540-39118-5_19 · Cited by 339 · see citing works
One-way functions are essential for complexity based cryptography
Impagliazzo, R., & Luby, M. G. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63483 · Cited by 338 · see citing works
Writing the Laboratory Notebook
Kanare, H. M. (1985) · Cited by 87 · see citing works
Gilles Brassard, A., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_7 · Cited by 58 · see citing works
A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
Galil, Z., Haber, S., & Yung, M. M. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.1 · Cited by 58 · see citing works
Self-citationOn the Design of Provably-Secure Cryptographic Hash Functions
Santis, A. D., & Yung, M. M. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_37 · Cited by 28 · see citing works
Flagged first, then by citations
Research works printed but not linked: 5
- J. Alter. When photographs lie. Newsweek, pp. 44-45, July 30, 1990.
- G. Brassard and M. Yung. One-way gr•up acti•ns. •n Advances in Crypt•l•gy_Crypt• •9•. Le•ture Notes in Computer Science, Springer-Verlag, Berlin, to appear.
- S. Goldwasser, S. Micali, and R. Rivest. A secure digital signature scheme. SIAM J. Comput., 17(2): 281-308, 1988.
- A. Grundberg. Ask it no questions: The camera can lie. The New York Times, Section 2, pp. 1,29, August 12,199O.
- R. Impagliazzo, L. Levin, and M. Luby. Pseudorandom generation from one-way functions. In Proc. 21st STOC, pp. 12-24. ACM, New York, 1989.
Cited by
Sorted by citations
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690 · see citing works
A Survey on Security and Privacy Issues of Bitcoin
Conti, M., Sandeep Kumar, E., Lal, C., & Ruj, S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2842460 · Cited by 1,116 · see citing works
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078 · see citing works
A survey on essential components of a self-sovereign identity
Mühle, A., Grüner, A., Gayvoronskaya, T., & Meinel, C. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.10.002 · Cited by 483 · see citing works
Lightweight blockchain for healthcare
Ismail, L., Materwala, H., & Zeadally, S. (2019) · IEEE Access · doi:10.1109/access.2019.2947613 · Cited by 260 · see citing works
Quantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109 · see citing works
“Blockchain is a technology that allows one to build decentralized ledgers in which different entities can register transactions that are grouped into blocks that are linked using hashes [21].”
BackgroundInfluentialOptimally Efficient Accountable Time-Stamping
Buldas, A., Lipmaa, H., & Schoenmakers, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_20 · Cited by 53 · see citing works
A Blockchain Implementation for the Cataloguing of CCTV Video Evidence
Kerr, M., Han, F., & Schyndel, R. V. (2018) · 2018 15th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS) · doi:10.1109/avss.2018.8639440 · Cited by 31 · see citing works
IoT and Blockchain for Support for Smart Contracts Through TpM
Yamaguti, R., Ferreira, L. C. B. C., Lui Motta, L., Montali Assumpção, R., Branquinho, O. C., Iervolino, G., & Cardieri, P. (2025) · Sensors · doi:10.3390/s25165001 · Cited by 4 · see citing works
“While the concept of blockchain may seem novel, its roots lie in the work of [9].”
Yagiz, M. A., Horasan, F., & Yurttakal, A. H. (2026) · arXiv · doi:10.48550/arxiv.2605.00065
AgentRoom: Concurrent Multi-Agent Coding in a CRDT-Backed Shared Workspace
Cho, S., & Lee, D. (2026) · arXiv · doi:10.48550/arxiv.2608.23740
- Authors
- Haber, S., & Stornetta, W. S.
- Venue
- Journal of Cryptology
- Published
- 1991-01
- Volume
- 3
- Issue
- 2
- Pages
- 99-111
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W1997911919
- Cited by
- 1,483
- References
- 20
- Citations by year
- 2026: 67 · 2025: 95 · 2024: 88 · 2023: 168 · 2022: 154 · 2021: 168 · 2020: 176 · 2019: 117 · 2018: 63 · 2017: 29 · 2016: 11 · 2015: 21 · 2014: 17 · 2013: 18 · 2012: 14
- FWCI
- 4.18
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Cryptology (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Keywords
- digital time stamping, document provenance, tamper detection, backdating, collusion resistance, electronic documents
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
