Designs, Codes and Cryptography
On the Composition of Matroids and Ideal Secret Sharing 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
A Representation of a Family of Secret Sharing Matroids
Designs, Codes and Cryptography
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
On Non-representable Secret Sharing Matroids
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of 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
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
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
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Journal of Combinatorial Theory Series A
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
| Hi-index | 0.00 |