Pages that link to "Item:Q766238"
From MaRDI portal
The following pages link to On the optimization of bipartite secret sharing schemes (Q766238):
Displaying 12 items.
- 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)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Strong security of linear ramp secret sharing schemes with general access structures (Q2203603) (← links)
- A rational threshold signature model and protocol based on different permissions (Q2336193) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- How to share a secret (Q3050283) (← links)
- Access structures determined by uniform polymatroids (Q6085192) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)
