On secret sharing schemes, matroids and polymatroids
From MaRDI portal
Publication:3056338
DOI10.1515/JMC.2010.004zbMath1201.94111MaRDI QIDQ3056338
Jaume Martí-Farré, Carles Padró
Publication date: 12 November 2010
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
matroidspolymatroidssecret sharingideal secret sharing schemesoptimization of secret sharing schemes for general access structures
Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)
Related Items
Linearly dependent vectorial decomposition of clutters ⋮ Secret-sharing schemes for very dense graphs ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Recent Advances in Non-perfect Secret Sharing Schemes ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ From clutters to matroids ⋮ Bipartite secret sharing and staircases ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Ideal multipartite secret sharing schemes ⋮ Ideal hierarchical secret sharing and lattice path matroids ⋮ Linear threshold multisecret sharing schemes ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ Completion and decomposition of a clutter into representable matroids ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Classes of matroids closed under minors and principal extensions ⋮ The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ Introduction to Secret-Sharing ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ On the optimization of bipartite secret sharing schemes
Cites Work
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- On secret-sharing matroids
- Matroid representations by partitions
- 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
- Almost affine codes
- Secret sharing schemes with three or four minimal qualified subsets
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Secret sharing schemes on access structures with intersection number equal to one
- Secret sharing schemes with bipartite access structure
- How to share a secret
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- Polymatroidal dependence structure of a set of random variables
- Decomposition constructions for secret-sharing schemes
- On characterization of entropy function via information inequalities
- On secret sharing systems
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- A Solution of the Shannon Switching Game
