Finding lower bounds on the complexity of secret sharing schemes by linear programming
type: Item
instance of: scholarly article
title: Finding lower bounds on the complexity of secret sharing schemes by linear programming
zbMATH Open document ID: 1262.68049
author: Carles Padró
author: Leonor Vázquez
author: An Yang
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6157669
zbMATH Keywords: secret sharing
zbMATH Keywords: linear programming
zbMATH Keywords: polymatroid
zbMATH Keywords: non-Shannon information inequalities
MaRDI profile type: Publication
full work available at URL: j.dam.2012.10.020
OpenAlex ID: W2152896621
cites work: Q3741626
cites work: Secret-Sharing Schemes: A Survey
cites work: On the Power of Nonlinear Secret-Sharing
cites work: Matroids Can Be Far from Ideal Secret Sharing
cites work: Secret Sharing and Non-Shannon Information Inequalities
cites work: Separating the Power of Monotone Span Programs over Different Fields
cites work: Tight bounds on the information rate of secret sharing schemes
cites work: On the classification of ideal secret sharing schemes
cites work: The Minimal Set of Ingleton Inequalities
cites work: Weighted decomposition construction for perfect secret sharing schemes
cites work: The size of a share must be large
cites work: An impossibility result on graph secret sharing
cites work: Networks, Matroids, and Non-Shannon Information Inequalities
cites work: On the optimization of bipartite secret sharing schemes
cites work: Polymatroidal dependence structure of a set of random variables
cites work: The complexity of the graph access structures on six participants
cites work: Q5626684
cites work: Geometric secret sharing schemes and their duals
cites work: Perfect secret sharing schemes on five participants
cites work: On secret sharing systems
cites work: On secret sharing schemes, matroids and polymatroids
cites work: Optimal complexity of secret sharing schemes with four minimal qualified subsets
cites work: Matroid representations by partitions
cites work: Adhesivity of polymatroids
cites work: Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
cites work: Q5390304
cites work: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
cites work: On secret-sharing matroids
cites work: How to share a secret
cites work: An explication of secret sharing schemes
cites work: Decomposition constructions for secret-sharing schemes
cites work: On the information rate of perfect secret sharing schemes
cites work: More information theoretical inequalities to be used in secret sharing?
cites work: Q3126447
cites work: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
cites work: On characterization of entropy function via information inequalities
DOI: 10.1016/J.DAM.2012.10.020
Recommended article: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
Recommended article: Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
Recommended article: Improving the linear programming technique in the search for lower bounds in secret sharing
Recommended article: Combinatorial lower bounds for secret sharing schemes
Recommended article: A linear construction of secret sharing schemes
Recommended article: Lower bounds for robust secret sharing schemes
Recommended article: The optimal linear secret sharing scheme for any given access structure
Recommended article: The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
Recommended article: Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes
Recommended article: Q4365724
description: scientific article; zbMATH DE number 6157669