The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Secret Sharing Made Short
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Verifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771
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
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
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
How to share a secret with cheaters
Tompa, M., & Woll, H. (1989) · Journal of Cryptology · doi:10.1007/bf02252871 · Cited by 388
Blakley, G. R., & Meadows, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_20 · Cited by 369
Micali, S. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_9 · Cited by 142
A uniform-complexity treatment of encryption and zero-knowledge
Goldreich, O. (1993) · Journal of Cryptology · doi:10.1007/bf02620230 · Cited by 132
Distributed fingerprints and secure information dispersal
Krawczyk, H. (1993) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/164051.164075 · Cited by 90
Self-citation
Cited by
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
All-or-nothing encryption and the package transform
Rivest, R. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052348 · Cited by 398
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2013) · ACM Transactions on Storage · doi:10.1145/2535929 · Cited by 330
DepSky: dependable and secure storage in a cloud-of-clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2011) · Proceedings of the sixth conference on Computer systems · doi:10.1145/1966445.1966449 · Cited by 320
Collaborative and secure sharing of healthcare data in multi-clouds
Fabian, B., Ermakova, T., & Junghanns, P. (2015) · Information Systems · doi:10.1016/j.is.2014.05.004 · Cited by 223
Metadata
- Authors
- Krawczyk, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-05
- Pages
- 136-146
- OpenAlex
- W2100265784
- Cited by
- 359
- References
- 12
- FWCI
- 6.94
- 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
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.