The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Security of Ramp Schemes
Open accessOverview
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Encyclopedia of Mathematics and its Applications.
L., Y. L., Jones, W. B., & Thron, W. J. (1982) · Mathematics of Computation · doi:10.2307/2007638 · Cited by 4,119
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
Self-citationHoffman, K. A. (1961) · Cited by 2,706
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
A modular approach to key safeguarding
Asmuth, C., & Bloom, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056651 · Cited by 673
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
Mignotte, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39466-4_27 · Cited by 265
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Secure Deduplication with Efficient and Reliable Convergent Key Management
Li, J., Chen, X., Li, M., Li, J., Lee, P. P. C., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.284 · Cited by 549
Threshold Implementations Against Side-Channel Attacks and Glitches
Nikova, S., Rechberger, C., & Rijmen, V. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935308_38 · Cited by 507
Key-Insulated Public Key Cryptosystems
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_5 · Cited by 400
Metadata
- Authors
- Blakley, G. R., & Meadows, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-12
- Pages
- 242-268
- OpenAlex
- W1534695542
- Cited by
- 369
- References
- 11
- FWCI
- 8.02
- Type
- conference paper
- 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: Security of Ramp Schemes. https://app.cochat.ai/papers/10.1007/3-540-39568-7_20
- The paper
- Blakley, G. R., & Meadows, C. (2007). Security of Ramp Schemes. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-39568-7_20
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.