Pages that link to "Item:Q5445507"

The following pages link to Matroids Can Be Far from Ideal Secret Sharing (Q5445507):

Displaying 17 items.

• Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
• Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
• On the optimization of bipartite secret sharing schemes (Q766238) (← links)
• An impossibility result on graph secret sharing (Q1039271) (← links)
• Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
• On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
• Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
• On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
• Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
• On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
• Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
• Secret-Sharing Schemes: A Survey (Q3005578) (← links)
• Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
• How to share a secret (Q3050283) (← links)
• Introduction to Secret-Sharing (Q5213649) (← links)
• Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)