The following pages link to On secret-sharing matroids (Q1204471):
Displayed 30 items.
- Linearly dependent vectorial decomposition of clutters (Q283705) (← links)
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- From clutters to matroids (Q405078) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- Matroid representations by partitions (Q1301662) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Classes of matroids closed under minors and principal extensions (Q1786053) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Completion and decomposition of a clutter into representable matroids (Q2259278) (← links)
- Ideal hierarchical secret sharing and lattice path matroids (Q2697480) (← links)
- The free product of M-fuzzifying matroids1 (Q2988582) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Top-heavy phenomena for transformations (Q5037928) (← links)
- Introduction to Secret-Sharing (Q5213649) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- One-adhesive polymatroids (Q5858540) (← links)
- A note on representing dowling geometries by partitions (Q5858543) (← links)
- Access structures determined by uniform polymatroids (Q6085192) (← links)
- On ideal and weakly-ideal access structures (Q6112264) (← links)