On the optimization of bipartite secret sharing schemes
From MaRDI portal
Publication:766238
DOI10.1007/s10623-011-9552-7zbMath1236.94075OpenAlexW2080161216MaRDI QIDQ766238
Jessica Ruth Metcalf-Burton, Oriol Farràs, Leonor Vázquez, Carles Padró
Publication date: 23 March 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/105969
Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)
Related Items (12)
Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Access structures determined by uniform polymatroids ⋮ Bipartite secret sharing and staircases ⋮ Strong security of linear ramp secret sharing schemes with general access structures ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Secret sharing on regular bipartite access structures ⋮ How to share a secret ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ A rational threshold signature model and protocol based on different permissions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Perfect secret sharing schemes on five participants
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Hierarchical threshold secret sharing
- Multipartite secret sharing by bivariate interpolation
- An impossibility result on graph secret sharing
- Monotone circuits for monotone weighted threshold functions
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Adhesivity of polymatroids
- Secret sharing schemes with bipartite access structure
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Two Constructions on Limits of Entropy Functions
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Characterizing Ideal Weighted Threshold Secret Sharing
- Polymatroidal dependence structure of a set of random variables
- Decomposition constructions for secret-sharing schemes
- On characterization of entropy function via information inequalities
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- Matroids Can Be Far from Ideal Secret Sharing
- Elements of Information Theory
This page was built for publication: On the optimization of bipartite secret sharing schemes
