Pages that link to "Item:Q1842517"
From MaRDI portal
The following pages link to Graph decompositions and secret sharing schemes (Q1842517):
Displaying 46 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- Robust vector space secret sharing schemes (Q293422) (← 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)
- Visual cryptography on graphs (Q626454) (← 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)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← 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)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Balanced equi-\(n\)-squares (Q2205119) (← 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)
- 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)
- Quantum secret sharing using the \(d\)-dimensional GHZ state (Q2412583) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
- (Q4691855) (← 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)
- ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK (Q5249040) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)
- Approximation and decomposition in lattices of clutters (Q6041563) (← links)
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations (Q6199502) (← links)
