On the optimization of bipartite secret sharing schemes
From MaRDI portal
Publication:766238
Recommendations
Cites work
- Adhesivity of polymatroids
- An explication of secret sharing schemes
- An impossibility result on graph secret sharing
- Characterizing Ideal Weighted Threshold Secret Sharing
- Decomposition constructions for secret-sharing schemes
- Elements of Information Theory
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Geometric secret sharing schemes and their duals
- Graph decompositions and secret sharing schemes
- Hierarchical threshold secret sharing
- How to share a secret
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- scientific article; zbMATH DE number 708803 (Why is no real title available?)
- scientific article; zbMATH DE number 1775428 (Why is no real title available?)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Matroids Can Be Far from Ideal Secret Sharing
- Monotone circuits for monotone weighted threshold functions
- Multipartite secret sharing by bivariate interpolation
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- On characterization of entropy function via information inequalities
- On secret sharing schemes, matroids and polymatroids
- On the classification of ideal secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On the Power of Nonlinear Secret-Sharing
- On the size of shares for secret sharing schemes
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Perfect secret sharing schemes on five participants
- Polymatroidal dependence structure of a set of random variables
- Secret sharing schemes with bipartite access structure
- Separating the Power of Monotone Span Programs over Different Fields
- Some improved bounds on the information rate of perfect secret sharing schemes
- The size of a share must be large
- Tight bounds on the information rate of secret sharing schemes
- Two Constructions on Limits of Entropy Functions
Cited in
(14)- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the information ratio of non-perfect secret sharing schemes
- Reduced access structures with four minimal qualified subsets on six participants
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Strong security of linear ramp secret sharing schemes with general access structures
- A rational threshold signature model and protocol based on different permissions
- Local bounds for the optimal information ratio of secret sharing schemes
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing on regular bipartite access structures
- How to share a secret
- scientific article; zbMATH DE number 1303145 (Why is no real title available?)
- On the Optimization of Bipartite Secret Sharing Schemes
- Access structures determined by uniform polymatroids
- Bipartite secret sharing and staircases
This page was built for publication: On the optimization of bipartite secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766238)
