Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid

DOI10.1016/j.disc.2011.01.003zbMath1229.05079arXiv0809.3010OpenAlexW2016146424MaRDI QIDQ533769

Jessica Ruth Metcalf-Burton

Publication date: 6 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.3010

zbMATH Keywords

secret sharinginformation rateVámos matroidnon-Shannon information inequalities

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Measures of information, entropy (94A17)

Related Items

Improving the linear programming technique in the search for lower bounds in secret sharing, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Common information, matroid representation, and secret sharing for matroid ports, On the optimization of bipartite secret sharing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the classification of ideal secret sharing schemes
• On secret-sharing matroids
• On the size of shares for secret sharing schemes
• The size of a share must be large
• Secret Sharing and Non-Shannon Information Inequalities
• On characterization of entropy function via information inequalities
• On secret sharing systems
• Matroids Can Be Far from Ideal Secret Sharing
• Theory of Cryptography