Pages that link to "Item:Q4307278"
From MaRDI portal
The following pages link to Decomposition constructions for secret-sharing schemes (Q4307278):
Displaying 50 items.
- Lower bounds for robust secret sharing schemes (Q287197) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- Robust vector space secret sharing schemes (Q293422) (← links)
- Complexity of universal access structures (Q413265) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- The complexity of the connected graph access structure on seven participants (Q515397) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Visual cryptography on graphs (Q626454) (← links)
- On-line secret sharing (Q664393) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← 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)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- General information dispersal algorithms (Q1274915) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- On identification secret sharing schemes. (Q1401951) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← 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)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- A perfect threshold secret sharing scheme to identify cheaters (Q1804974) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- Some democratic secret sharing schemes (Q1893162) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Strong security of linear ramp secret sharing schemes with general access structures (Q2203603) (← 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)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← 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)
