Pages that link to "Item:Q2632007"
From MaRDI portal
The following pages link to Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007):
Displaying 7 items.
- 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)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)