Pages that link to "Item:Q676919"
From MaRDI portal
The following pages link to Perfect secret sharing schemes on five participants (Q676919):
Displayed 30 items.
- More information theoretical inequalities to be used in secret sharing? (Q287126) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- The complexity of the connected graph access structure on seven participants (Q515397) (← links)
- A generalized information theoretical model for quantum secret sharing (Q517681) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- A note on secret sharing schemes with three homogeneous access structure (Q845987) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087) (← links)
- The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)
- Approximation and decomposition in lattices of clutters (Q6041563) (← links)
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures (Q6104673) (← links)