The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Secret-Sharing Schemes: A Survey
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 4×
“For example, Shamir’s scheme [58] is ideal.”
BackgroundMethodInfluentialAttribute-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
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
ASH, R. B. (1966) · Cited by 3,990
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
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
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 882
Secure schemes for secret sharing and key distribution
Beimel, A. (1996) · Medical Entomology and Zoology · Cited by 779
Self-citationVerifiable 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
Information Theory and Network Coding
Yeung, R. W., Wolf, J. K., & Gallager, R. G. (2008) · Springer eBooks · doi:10.1007/978-0-387-79234-7 · Cited by 708
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
Advances in Cryptology — CRYPTO ’91: Proceedings
(1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1 · Cited by 687
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
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
Limits on the provable consequences of one-way permutations
Impagliazzo, R., & Rudich, S. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73012 · Cited by 575
Simple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
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
Karchmer, M., & Wigderson, A. (2002) · [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference · doi:10.1109/sct.1993.336536 · Cited by 486
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
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_37 · Cited by 394
On characterization of entropy function via information inequalities
Zhang, Z., & Yeung, R. W. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681320 · Cited by 351
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
A personal view of average-case complexity
Impagliazzo, R. (2002) · Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference · doi:10.1109/sct.1995.514853 · Cited by 298
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
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
Kushilevitz, E. (1997) · Advances in Computers · doi:10.1016/s0065-2458(08)60342-3 · Cited by 252
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
Hirt, M., & Maurer, U. (2000) · Journal of Cryptology · doi:10.1007/s001459910003 · Cited by 233
Seberry, J., & Yan, Z. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1 · Cited by 212
Decomposition constructions for secret-sharing schemes
Stinson, D. R. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.272461 · Cited by 186
Shared Generation of Authenticators and Signatures (Extended Abstract)
Desmedt, Y., & Frankel, Y. (1991) · UCL Discovery (University College London) · Cited by 159
On the information rate of perfect secret sharing schemes
van Dijk, M. (1995) · Designs Codes and Cryptography · doi:10.1007/bf01398012 · Cited by 148
Multiple assignment scheme for sharing secret
Ito, M., Saito, A., & Nishizeki, T. (1993) · Journal of Cryptology · doi:10.1007/bf02620229 · Cited by 131
Tight Bounds on the Information Rate of Secret Sharing Schemes
Blundo, C., Santis, A. D., Simone, R. D., & Vaccaro, U. (1997) · Designs Codes and Cryptography · doi:10.1023/a:1008216403325 · Cited by 112
Universally ideal secret-sharing schemes
Beimel, A., & Chor, B. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335890 · Cited by 111
Self-citationMultipartite Secret Sharing by Bivariate Interpolation
Tassa, T., & Dyn, N. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9027-9 · Cited by 100
Robust computational secret sharing and a unified account of classical secret-sharing goals
Mihir Bellare, Y., & Rogaway, P. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315268 · Cited by 88
A construction of practical secret sharing schemes using linear block codes
Bertilsson, M., & Ingemarsson, I. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1_53 · Cited by 80
Access control and signatures via quorum secret sharing
Naor, M., & Wool, A. (1998) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.722223 · Cited by 80
A characterization of span program size and improved lower bounds for monotone span programs
G�l, A. (2001) · Computational Complexity · doi:10.1007/s000370100001 · Cited by 59
Blundo, C., Santis, A. D., & Vaccaro, U. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(97)00194-4 · Cited by 44
Secret sharing over infinite domains
Chor, B., & Kushilevitz, E. (1993) · Journal of Cryptology · doi:10.1007/bf02620136 · Cited by 39
Secret Sharing and Non-Shannon Information Inequalities
Beimel, A., & Orlov, I. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162183 · Cited by 30
Self-citationSecret Sharing and Non-Shannon Information Inequalities
Beimel, A., & Orlov, I. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_32 · Cited by 18
Self-citation
Cited by
How to use indistinguishability obfuscation: deniable encryption, and more
Sahai, A., & Waters, B. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591825 · Cited by 624
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends
Ateniese, G., Magri, B., Venturi, D., & Andrade, E. (2017) · 2017 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2017.37 · Cited by 433
Witness encryption and its applications
Garg, S., Gentry, C., Sahai, A., & Waters, B. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488667 · Cited by 333
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3054610 · Cited by 318
Metadata
- Authors
- Beimel, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 11-46
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W51265332
- Cited by
- 652
- References
- 55
- FWCI
- 18.09
- 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.