The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Timed Commitments
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
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
Self-citationA Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Self-citationThe Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Self-citationTime-lock Puzzles and Timed-release Crypto
Rivest, R. L., Adi Shamir, Z., & Wagner, D. (1996) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 546
Limits on the security of coin flips when half the processors are faulty
Cleve, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12168 · Cited by 451
Dwork, C., Naor, M., & Sahai, A. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276853 · Cited by 425
Self-citationOn the Composition of Zero-Knowledge Proof Systems
Goldreich, O., & Krawczyk, H. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539791220688 · Cited by 423
Optimistic fair exchange of digital signatures: Extended abstract
Asokan, N., Shoup, V., & Waidner, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054156 · Cited by 305
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
Damgård, I. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_30 · Cited by 295
A fair protocol for signing contracts
Ben-Or, M., Goldreich, O., Micali, S., & Rivest, R. L. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.50372 · Cited by 287
Dwork, C., & Naor, M. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892117 · Cited by 264
Self-citationTransaction protection by beacons
Rabin, M. O. (1983) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(83)90042-9 · Cited by 206
Blum, M. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357360.357368 · Cited by 205
Abuse-Free Optimistic Contract Signing
Garay, J. A., Jakobsson, M., & MacKenzie, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_29 · Cited by 161
Efficient verifiable encryption (and fair exchange) of digital signatures
Ateniese, G. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319728 · Cited by 161
Bellare, M., & Goldwasser, S. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266439 · Cited by 136
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
Cleve, R. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_50 · Cited by 87
Optimal efficiency of optimistic contract signing
Pfitzmann, B., Schunter, M., & Waidner, M. (1998) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/277697.277717 · Cited by 57
An Efficient Existentially Unforgeable Signature Scheme and Its Applications
Dwork, C., & Naor, M. (1998) · Journal of Cryptology · doi:10.1007/s001459900043 · Cited by 54
Self-citation
Cited by
A Survey of Attacks on Ethereum Smart Contracts (SoK)
Atzei, N., Bartoletti, M., & Cimoli, T. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54455-6_8 · Cited by 1,553
“Alternative solutions to this problem are based on timed commitment protocols [25, 29].”
BackgroundSmart contract applications within blockchain technology: a systematic mapping study
Macrinici, D., Cartofeanu, C., & Gao, S. (2018) · Telematics and Informatics · doi:10.1016/j.tele.2018.10.004 · Cited by 458
Boneh, D., Bonneau, J., Bünz, B., & Fisch, B. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96884-1_25 · Cited by 413
Self-citationSecure Multiparty Computations on Bitcoin
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, L. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.35 · Cited by 345
How to Use Bitcoin to Design Fair Protocols
Bentov, I., & Kumaresan, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44381-1_24 · Cited by 339
Metadata
- Authors
- Boneh, D., & Naor, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 236-254
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2913157813
- Cited by
- 307
- References
- 27
- FWCI
- 6.20
- 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
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.