scientific article; zbMATH DE number 708804
From MaRDI portal
Publication:4318692
Recommendations
- scientific article; zbMATH DE number 708803
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Tight bounds on the information rate of secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- Graph decompositions and secret sharing schemes
Cited in
(26)- Hypergraph decomposition and secret sharing
- Secret sharing schemes for graph-based prohibited structures
- An explication of secret sharing schemes
- Anonymous secret sharing schemes
- Weighted decomposition construction for perfect secret sharing schemes
- Reduced access structures with four minimal qualified subsets on six participants
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- On the information rate of perfect secret sharing schemes
- Recursive constructions for perfect secret sharing schemes
- Optimal assignment schemes for general access structures based on linear programming
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
- Local bounds for the optimal information ratio of secret sharing schemes
- Optimal linear secret sharing schemes for graph access structures on six participants
- Lower bounds for robust secret sharing schemes
- Secret-sharing schemes for very dense graphs
- On secret sharing schemes
- New Lower Bounds for Privacy in Communication Protocols
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
- On entropy, information inequalities, and groups
- New bounds on the information rate of secret sharing schemes
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
- Fully dynamic secret sharing schemes
- On the information rate of secret sharing schemes
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318692)
