The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On sharing secrets and Reed-Solomon codes
Open accessAbstract
Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Cited by
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
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
An explication of secret sharing schemes
Stinson, D. R. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00125203 · Cited by 396
Boosting Privately: Federated Extreme Gradient Boosting for Mobile Crowdsensing
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., Deng, R. H., & Ren, K. (2020) · 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs47774.2020.00017 · Cited by 93
Boosting Privately: Privacy-Preserving Federated Extreme Boosting for Mobile Crowdsensing
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., & Deng, R. (2019) · arXiv · doi:10.48550/arxiv.1907.10218 · Cited by 52
Metadata
- Authors
- McEliece, R. J., & Sarwate, D. V.
- Venue
- Communications of the ACM
- Published
- 1981-09
- Volume
- 24
- Issue
- 9
- Pages
- 583-584
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1990304797
- Cited by
- 625
- References
- 1
- FWCI
- 0.00
- 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: On sharing secrets and Reed-Solomon codes. https://app.cochat.ai/papers/10.1145/358746.358762
- The paper
- McEliece, R. J., & Sarwate, D. V. (1981). On sharing secrets and Reed-Solomon codes. Communications of the ACM. https://doi.org/10.1145/358746.358762
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.
