Pages that link to "Item:Q1180513"
From MaRDI portal
The following pages link to On the classification of ideal secret sharing schemes (Q1180513):
Displaying 50 items.
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← 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)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions (Q845708) (← 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)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- General information dispersal algorithms (Q1274915) (← links)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- Matroid representations by partitions (Q1301662) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- On identification secret sharing schemes. (Q1401951) (← links)
- Probability of shares in secret sharing schemes (Q1607017) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Powerful sets: a generalisation of binary matroids (Q1671667) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← links)
- Secret sharing schemes based on graphical codes (Q2016393) (← links)
- Secret sharing and duality (Q2033511) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems (Q2160700) (← links)
- Abelian sharing, common informations, and linear rank inequalities (Q2168805) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← 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 on the \(d\)-dimensional cube (Q2260799) (← links)
- On counting subspaces of near-vector spaces (Q2286601) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- A remark on hierarchical threshold secret sharing (Q2443016) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
