The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Proofs of Work and Bread Pudding Protocols(Extended Abstract)
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
Pricing via processing or combatting junk mail
Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282
PayWord and MicroMint: Two simple micropayment schemes
Rivest, R. L., & Shamir, A. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62494-5_6 · Cited by 621
Time-lock Puzzles and Timed-release Crypto
Rivest, R. L., Adi Shamir, Z., & Wagner, D. (1996) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 546
On hiding information from an oracle
Abadi, M., Feigenbaum, J., & Kilian, J. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90018-4 · Cited by 200
Software reliability via run-time result-checking
Wasserman, H., & Blum, M. (1997) · Journal of the ACM · doi:10.1145/268999.269003 · Cited by 192
Bellare, M., & Goldwasser, S. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266439 · Cited by 136
Distributed Execution with Remote Audit.
Monrose, F., Wyckoff, P., & Rubin, A. D. (1999) · Cited by 97
Auditable metering with lightweight security
Franklin, M. K., & Malkhi, D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63594-7_75 · Cited by 82
Publicly verifiable lotteries: Applications of delaying functions
Goldschlag, D. M., & Stubblebine, S. G. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055485 · Cited by 75
Curbing junk e-mail via secure classification
Gabber, E., Jakobsson, M., Matias, Y., & Mayer, A. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055484 · Cited by 69
Self-citation
Cited by
Blockchain without waste: Proof-of-stake
Saleh, F. (2021) · The Review of Financial Studies · doi:10.1093/rfs/hhaa075 · Cited by 825
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7_29 · Cited by 294
Sanka, A. I., Irfan, M., Huang, I., & Cheung, R. C. C. (2021) · Computer Communications · doi:10.1016/j.comcom.2020.12.028 · Cited by 265
Blockchain-based resource allocation model in fog computing
Wang, H., Wang, L., Zhou, Z., Tao, X., Pau, G., & Arena, F. (2019) · Applied Sciences · doi:10.3390/app9245538 · Cited by 58
“The consensus layer implements various consensus algorithms such as Proof of Work (PoW) [15] and Proof of Stake (PoS) [16] or Delegated Proof of Stake (DPoS) [17].”
MethodEdgeTC - a PBFT blockchain-based ETC scheme for smart cities
Chiu, W.-Y., & Meng, W. (2021) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-021-01119-0 · Cited by 37
Metadata
- Authors
- Jakobsson, M., & Juels, A.
- Venue
- Secure Information Networks
- Publisher
- Springer US
- Published
- 1999
- Pages
- 258-272
- OpenAlex
- W185290757
- Cited by
- 284
- References
- 11
- Type
- paratext
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Proofs of Work and Bread Pudding Protocols(Extended Abstract). https://app.cochat.ai/papers/10.1007/978-0-387-35568-9_18
- The paper
- Jakobsson, M., & Juels, A. (1999). Proofs of Work and Bread Pudding Protocols(Extended Abstract). Secure Information Networks. https://doi.org/10.1007/978-0-387-35568-9_18
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.