The following pages link to (Q4318692):
Displaying 25 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)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← 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)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions (Q845708) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← 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)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← 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)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- New Lower Bounds for Privacy in Communication Protocols (Q2948253) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- On Entropy, Information Inequalities, and Groups (Q3448760) (← links)
- New bounds on the information rate of secret sharing schemes (Q4838690) (← links)
