Probability of shares in secret sharing schemes☆
References (14)
- et al.
On secret sharing schemes
Inform. Process. Lett.
(1998) - et al.
Randomness in distribution protocols
Inform. and Comput.
(1996) - et al.
Generalized secret sharing and monotone functions
Safeguarding cryptographic keys
- et al.
On the dealer's randomness required in secret sharing schemes
- et al.
On the classification of ideal secret sharing schemes
J. Cryptology
(1991) - et al.
Improved bounds on the information rate of perfect secret sharing schemes
J. Cryptology
(1992)
There are more references available in the full text version of this article.
Cited by (4)
Hierarchical and shared access control
2016, IEEE Transactions on Information Forensics and SecurityThe Kraft inequality for EPS systems
2013, IEEE International Symposium on Information Theory - ProceedingsOn matroids and nonideal secret sharing
2008, IEEE Transactions on Information TheoryOn matroids and non-ideal secret sharing
2006, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
Partially supported by Italian Ministry of University and Scientific Research (M.U.R.S.T.).
Copyright © 1999 Published by Elsevier B.V.