Design theory
Journal of Combinatorial Theory Series B
An explication of secret sharing schemes
Designs, Codes and Cryptography
Communications of the ACM
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Graph decompositions and secret sharing schemes
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the Dealer‘s Randomness Required in Secret Sharing Schemes
Designs, Codes and Cryptography
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Information Processing Letters
Secret Sharing in Graph-Based Prohibited Structures
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Information Processing Letters
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
Information Sciences: an International Journal
| Hi-index | 0.00 |
We use two combinatorial techniques to apply a decomposition construction in obtaining general lower bounds on information rate and average information rate of certain general classes of access structures. The first technique uses combinatorial designs (in particular, Steiner systems S(t, k, v)). The second technique uses equitable edge-colourings of bipartite graphs. For uniform access structures of rank t, this second technique improves the best previous general bounds by a factor of t (asymptotically).