Optimally Efficient Accountable Time-Stamping
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?
Exonum uses a BFT Bitcoin anchoring algorithm that periodically outputs the hash digest of a recent block to Bitcoin, authenticated by a supermajority, with chaining similar to paper-based anchoring [75].
“Exonum uses a BFT Bitcoin anchoring algorithm, which is packaged as a separate service. The algorithm periodically outputs the hash digest of a recent block on an Exonum blockchain, which commits to the entire blockchain state and transaction history, in a transaction on the Bitcoin blockchain. The anchoring transaction has a well-defined form and must be authenticated by a supermajority of valid”
From Converging blockchain and next-generation artificial intelligence technologies to decentralize and accelerate biomedical research and healthcare (2018) · cites this paper as [75]
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
Advances in Cryptology — CRYPTO’ 99
Wiener, M. J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1 · Cited by 2,621 · see citing works
How to time-stamp a digital document
Haber, S., & Stornetta, W. S. (1991) · Journal of Cryptology · doi:10.1007/bf00196791 · Cited by 1,483 · see citing works
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418 · see citing works
Advances in Cryptology -- CRYPTO 2015
Gennaro, R., & Robshaw, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48000-7 · Cited by 661 · see citing works
Advances in Cryptology – EUROCRYPT 2018
(2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7 · Cited by 620 · see citing works
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572 · see citing works
How to Time-Stamp a Digital Document
Haber, S., & Stornetta, W. S. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_32 · Cited by 407 · see citing works
Improving the Efficiency and Reliability of Digital Time-Stamping
Bayer, D., Haber, S., & Stornetta, W. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9323-8_24 · Cited by 385 · see citing works
Time-stamping with binary linking schemes
Buldas, A., Laud, P., Lipmaa, H., et al. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055749 · Cited by 118 · see citing works
Self-citationOne-way Accumulators: A Decentralized Alternative to Digital Signatures (Extended Abstract)
Benaloh, J., & de Mare, M. (1993) · Cited by 97 · see citing works
Efficient Broadcast Time-Stamping
Benaloh, J., & de Mare, M. (1991) · Cited by 67 · see citing works
Proceedings-1983 Symposium on Security and Privacy
(1984) · IEEE Micro · doi:10.1109/mm.1984.291344 · Cited by 61 · see citing works
Efficient Accumulators without Trapdoor Extended Abstract
Sander, T. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-47942-0_21 · Cited by 51 · see citing works
New linking schemes for digital time-stamping.
Buldas, A., & Laud, P. (1998) · Cited by 27 · see citing works
Self-citation
Flagged first, then by citations
Research works printed but not linked: 1
- Tomas Sander. Efficient Accumulators without Trapdoor. In The Second International Conference on Information and Communication Security, Syd- ney, Australia, 9-11 November 1999. To appear. 296
Cited by
Sorted by citations
Mamoshina, P., Ojomoko, L., Yanovich, Y., Ostrovski, A., Botezatu, A., Prikhodko, P., Izumchenko, E., Aliper, A., Romantsov, K., Zhebrak, A., et al. (2018) · Oncotarget · doi:10.18632/oncotarget.22345 · Cited by 471 · see citing works
- Authors
- Buldas, A., Lipmaa, H., & Schoenmakers, B.
- Affiliations
- Eindhoven University of Technology (NL)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 293-305
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2148588576
- Cited by
- 53
- References
- 14
- Citations by year
- 2024: 1 · 2023: 1 · 2022: 3 · 2021: 1 · 2020: 3 · 2019: 2 · 2018: 1 · 2017: 1 · 2015: 1 · 2013: 1 · 2012: 4
- FWCI
- 2.76
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Lecture notes in computer science (publishedVersion)
- TU/e Research Portal (publishedVersion)
- TU/e Research Portal (submittedVersion)
- 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 › Artificial Intelligence › Coding theory and cryptography
- Keywords
- fraud detection, optimal protocols
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
