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
Geometric secret sharing schemes and their duals
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
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
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 bipartite access structure
IEEE Transactions on Information Theory
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
An impossibility result on graph secret sharing
Designs, Codes and Cryptography
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
SIAM Journal on Discrete Mathematics
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
Complexity of universal access structures
Information Processing Letters
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.