Generalized Secret Sharing and Monotone Functions
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Overview
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
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
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
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
Verifiable secret-ballot elections
Benaloh, J. (1987) · Cited by 481
Self-citationSecret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
Benaloh, J. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_19 · Cited by 164
Self-citationGeneralized Linear Threshold Scheme
Kothari, S. C. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_19 · Cited by 104
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
“However, in these definitions the attributes will describe the users and the access structures will be used to label different sets of encrypted data.”
BackgroundAttribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
Attribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
Theory of quantum secret sharing
Gottesman, D. (2000) · Physical Review A · doi:10.1103/physreva.61.042311 · Cited by 618
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Cramer, R., Damgård, I., & Maurer, U. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_22 · Cited by 533
Some Ideal Secret Sharing Schemes
Brickell, E. F. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_45 · Cited by 474
Protecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276723 · Cited by 445
An explication of secret sharing schemes
Stinson, D. R. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00125203 · Cited by 396
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_12 · Cited by 359
On the classification of ideal secret sharing schemes
Brickell, E. F., & Davenport, D. M. (1991) · Journal of Cryptology · doi:10.1007/bf00196772 · Cited by 294
Controlling Access to Published Data Using Cryptography
Miklau, G., & Suciu, D. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50084-7 · Cited by 289
Efficient and Generalized Group Signatures
Camenisch, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_32 · Cited by 257
On the size of shares for secret sharing schemes
Capocelli, R. M., De Santis, A., Gargano, L., & Vaccaro, U. (1993) · Journal of Cryptology · doi:10.1007/bf00198463 · Cited by 257
Metadata
- Authors
- Benaloh, J., & Leichter, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer New York
- Published
- 1990
- Pages
- 27-35
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2099000090
- Cited by
- 677
- References
- 8
- FWCI
- 8.68
- Type
- conference paper
- 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
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.