The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A modular approach to key safeguarding
Abstract
A method is proposed for a key safeguarding scheme (threshold scheme) in which the shadows are congruence classes of a number associated with the original key. A variation of this scheme provides efficient error detection and even exposes deliberate tampering. Certain underlying similarities of this scheme with Shamir's interpolation method make it possible to incorporate these protective features in that method as well.
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
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
Cited by
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
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
Blakley, G. R., & Meadows, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_20 · Cited by 369
How to (Really) Share a Secret
Simmons, G. J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_30 · Cited by 300
Decentralized and Privacy-Preserving Key Management Model
Soltani, R., Nguyen, U. T., & An, A. (2020) · 2020 International Symposium on Networks, Computers and Communications (ISNCC) · doi:10.1109/isncc49221.2020.9297294 · Cited by 8
Metadata
- Authors
- Asmuth, C., & Bloom, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1983-03
- Volume
- 29
- Issue
- 2
- Pages
- 208-210
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2133062571
- Cited by
- 673
- References
- 2
- FWCI
- 0.44
- 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: A modular approach to key safeguarding. https://app.cochat.ai/papers/10.1109/tit.1983.1056651
- The paper
- Asmuth, C., & Bloom, J. (1983). A modular approach to key safeguarding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1983.1056651
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.