The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A fair protocol for signing contracts
Abstract
Two parties, A and B, want to sign a contract C over a communication network. To do so, they must simultaneously exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in piece-by-piece manner. During such a protocol, one party or another may have a slight advantage; a fair protocol keeps this advantage within acceptable limits. A new protocol is proposed. It is fair in the sense that, at any stage in its execution, the conditional probability that one party cannot commit both parties to the contract given that the other party can, is close to zero. This is true even if A and B have vastly different computing powers and is proved under very weak cryptographic assumptions.>
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Self-citationA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Self-citationA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Self-citationHow to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Self-citationA 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
Self-citationHow to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Self-citationTheory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
One way functions and pseudorandom generators
Levin, L. A. (1987) · Combinatorica · doi:10.1007/bf02579323 · Cited by 257
Transaction 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
One-way functions and pseudorandom generators
Levin, L. A. (1985) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/22145.22185 · Cited by 106
A “Paradoxical” Solution to The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_37 · Cited by 73
Self-citationA Simple Protocol for Signing Contracts
Goldreich, O. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_11 · Cited by 66
Self-citationHow To Sign Given Any Trapdoor Function
Mihir Bellare, Y., & Micali, S. M. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_15 · Cited by 66
Self-citationA protocol for signing contracts
Even, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008913 · Cited by 51
How to sign given any trapdoor function
Mihir Bellare, Y., & Micali, S. M. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62216 · Cited by 28
Self-citation
Cited by
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Self-citationHow to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Self-citationAsynchronous protocols for optimistic fair exchange
Asokan, N., Shoup, V., & Waidner, M. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674826 · Cited by 316
Boneh, D., & Naor, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_15 · Cited by 307
Efficient and practical fair exchange protocols with off-line TTP
Bao, F., Deng, R. H., & Mao, W. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674825 · Cited by 295
Metadata
- Authors
- Ben-Or, M., Goldreich, O., Micali, S., & Rivest, R. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1990-01
- Volume
- 36
- Issue
- 1
- Pages
- 40-46
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2103221883
- Cited by
- 287
- References
- 18
- FWCI
- 0.40
- Type
- journal article
- 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.