Pages that link to "Item:Q1358672"
From MaRDI portal
The following pages link to Tight bounds on the information rate of secret sharing schemes (Q1358672):
Displaying 50 items.
- More information theoretical inequalities to be used in secret sharing? (Q287126) (← 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)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← 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)
- Perfect secret sharing schemes on five participants (Q676919) (← 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)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917) (← links)
- A linear construction of secret sharing schemes (Q1368734) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← 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)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Privacy-preserving outsourcing of image feature extraction in cloud computing (Q1701922) (← 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)
- Graph decompositions and secret sharing schemes (Q1842517) (← 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)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← 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)
- 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)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← 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)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- New bounds on the information rate of secret sharing schemes (Q4838690) (← links)
