Pages that link to "Item:Q290386"

The following pages link to Secret-sharing schemes for very dense graphs (Q290386):

Displaying 16 items.

• Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← 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)
• Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
• Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
• The share size of secret-sharing schemes for almost all access structures and graphs (Q2119092) (← links)
• On the information ratio of graphs without high-degree neighbors (Q2231745) (← 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)
• Percolation in the secrecy graph (Q2446856) (← links)
• Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
• Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
• Access structure in graphs in high dimension and application to secret sharing (Q2958434) (← links)
• (Q4550483) (← links)