Pages that link to "Item:Q2440328"
From MaRDI portal
The following pages link to The optimal linear secret sharing scheme for any given access structure (Q2440328):
Displaying 13 items.
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures (Q477568) (← links)
- Linear secret sharing schemes and rearrangements of access structures (Q705055) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Linear secret-sharing schemes for forbidden graph access structures (Q1690278) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme (Q2309688) (← links)
- Ideal access structures based on a class of minimal linear codes (Q2958257) (← links)
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field (Q3183580) (← links)
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032) (← links)
- ON THE COMPOSITION OF SECRET SHARING SCHEMES RELATED TO CODES (Q5411808) (← links)
- Optimal binary linear codes from posets of the disjoint union of two chains (Q6112206) (← links)
