Pages that link to "Item:Q1202917"

The following pages link to Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917):

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)
• 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)
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← 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)
• 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)
• Constructions for anonymous secret sharing schemes using combinatorial designs (Q871669) (← links)
• An impossibility result on graph secret sharing (Q1039271) (← links)
• Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
• Geometric secret sharing schemes and their duals (Q1321560) (← links)
• Tight bounds on the information rate of secret sharing schemes (Q1358672) (← links)
• Anonymous secret sharing schemes (Q1364776) (← links)
• Probability of shares in secret sharing schemes (Q1607017) (← links)
• Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
• On the information ratio of non-perfect secret sharing schemes (Q1688395) (← 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)
• 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)
• Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes (Q1910425) (← links)
• An efficient construction of perfect secret sharing schemes for graph-based structures (Q1912864) (← links)
• Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
• Generalized threshold secret sharing and finite geometry (Q1981787) (← links)
• Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
• Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
• Secret sharing on the \(d\)-dimensional cube (Q2260799) (← 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)
• 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)
• Perfect secret sharing schemes for graph access structures on six participants (Q2854182) (← 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)
• Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
• Secret sharing schemes on graphs (Q3531289) (← links)
• New secret sharing schemes from old (Q4288075) (← links)
• (Q4691855) (← links)