Pages that link to "Item:Q4838690"
From MaRDI portal
The following pages link to New bounds on the information rate of secret sharing schemes (Q4838690):
Displaying 16 items.
- 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)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Tight bounds on the information rate of secret sharing schemes (Q1358672) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← 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)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- New secret sharing schemes from old (Q4288075) (← links)
- Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources (Q5224132) (← links)
