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
On the information rate of perfect 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
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An impossibility result on graph secret sharing
Designs, Codes and Cryptography
SIAM Journal on Discrete Mathematics
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
Finding lower bounds on the complexity of secret sharing schemes by linear programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
| Hi-index | 0.89 |
By using threshold schemes, λ -decompositions were introduced by Stinson [D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory IT-40 (1994) 118-125] and used to achieve often optimal worst-case information rates of secret sharing schemes based on graphs. By using the broader class of ramp schemes, (λ,ω)-decompositions were introduced in [M. van Dijk, W.-A. Jackson, K.M. Martin, A general decomposition construction for incomplete secret sharing schemes, Des. Codes Cryptogr. 15 (1998) 301-321] together with a general theory of decompositions. However, no improvements of existing schemes have been found by using this general theory. In this contribution we show for the first time how to successfully use (λ,ω)-decompositions. We give examples of improved constructions of secret sharing schemes based on connected graphs on six vertices.