Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants
Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Secret sharing schemes with bipartite access structure
IEEE Transactions on Information Theory
Decomposition constructions for secret-sharing schemes
IEEE Transactions on Information Theory
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
| Hi-index | 0.89 |
A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. This paper deals with these problems for 3-homogeneous access structures, that is, whenever the minimal qualified subsets have exactly three participants.