The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
How to exchange (secret) keys
Open accessAbstract
KeysA protocol is presented whereby two adversaries may exchange secrets, although neither trusts the other.The secrets are the prime factors of their publicly announced composite numbers.The two adversaries can exchange their secrets bit by bit, but each fears the other will cheat by sending "junk" bits.To solve this problem we show how each of the two can prove, for each bit delivered, that the bit is good.Applications are suggested to such electronic business transactions as signing contracts and sending certified electronic mail.
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
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
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
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
Society and Group Oriented Cryptography: a New Concept
Desmedt, Y. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_8 · Cited by 433
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
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Metadata
- Authors
- Blum, M.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1983-05
- Volume
- 1
- Issue
- 2
- Pages
- 175-193
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2026755693
- Cited by
- 205
- References
- 1
- FWCI
- 5.29
- Type
- journal article
- Language
- en
- Open access
- bronze
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 exchange (secret) keys. https://app.cochat.ai/papers/10.1145/357360.357368
- The paper
- Blum, M. (1983). How to exchange (secret) keys. ACM Transactions on Computer Systems. https://doi.org/10.1145/357360.357368
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.