The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
An explication of secret sharing schemes
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
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
Beth, T., Jungnickel, D., & Lenz, H. (1985) · Cited by 1,360
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
Secret sharing scheme realizing general access structure
Ito, M., Saito, A., & Nishizeki, T. (1989) · Electronics and Communications in Japan (Part III: Fundamental Electronic Science) · doi:10.1002/ecjc.4430720906 · Cited by 681
Generalized Secret Sharing and Monotone Functions
Benaloh, J., & Leichter, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_3 · Cited by 677
Karnin, E., Greene, J., & Hellman, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056621 · Cited by 630
On sharing secrets and Reed-Solomon codes
McEliece, R. J., & Sarwate, D. V. (1981) · Communications of the ACM · doi:10.1145/358746.358762 · Cited by 625
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Metadata
- Authors
- Stinson, D. R.
- Venue
- Designs, Codes and Cryptography
- Published
- 1992-12
- Volume
- 2
- Issue
- 4
- Pages
- 357-390
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W2088023978
- Cited by
- 396
- References
- 21
- FWCI
- 12.52
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An explication of secret sharing schemes. https://app.cochat.ai/papers/10.1007/bf00125203
- The paper
- Stinson, D. R. (1992). An explication of secret sharing schemes. Designs, Codes and Cryptography. https://doi.org/10.1007/bf00125203
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.
