The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
How to Use Bitcoin to Design Fair Protocols
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
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
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies
Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J. A., & Felten, E. W. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.14 · Cited by 1,246
Metadata
- Authors
- Bentov, I., & Kumaresan, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2014
- Pages
- 421-439
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W111114747
- Cited by
- 339
- References
- 70
- FWCI
- 16.01
- Type
- conference paper
- 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: How to Use Bitcoin to Design Fair Protocols. https://app.cochat.ai/papers/10.1007/978-3-662-44381-1_24
- The paper
- Bentov, I., & Kumaresan, R. (2014). How to Use Bitcoin to Design Fair Protocols. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-44381-1_24
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.