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

DOI10.1016/J.DISC.2011.01.003MaRDI QIDQ533769zbMATHOpenAlexFDO

Authors 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

information ratesecret sharingnon-Shannon information inequalitiesVámos matroid

Mathematics Subject Classification ID

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

Abstract: An access structure specifying the qualified sets of a secret sharing scheme must have information rate less than or equal to one. The Vamos matroid induces two non-isomorphic access structures V1 and V6, which were shown by Marti-Farre and Padro to have information rates of at least 3/4. Beimel, Livne, and Padro showed that the information rates of V1 and V6 are bounded above by 10/11 and 9/10 respectively. Here we improve those upper bounds to 19/21 for V1 and 17/19 for V6.

Recommendations

• Matroids Can Be Far from Ideal Secret Sharing
• On Secret Sharing Schemes, Matroids and Polymatroids
• On Matroids and Nonideal Secret Sharing
• On secret sharing schemes, matroids and polymatroids
• Tight bounds on the information rate of secret sharing schemes

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• Matroids Can Be Far from Ideal Secret Sharing
• On characterization of entropy function via information inequalities
• On secret sharing systems
• On secret-sharing matroids
• On the classification of ideal secret sharing schemes
• On the size of shares for secret sharing schemes
• Secret Sharing and Non-Shannon Information Inequalities
• The size of a share must be large
• Theory of Cryptography

Cited in

(6)

• On the optimization of bipartite secret sharing schemes
• Matroids Can Be Far from Ideal Secret Sharing
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
• Common information, matroid representation, and secret sharing for matroid ports
• Finding lower bounds on the complexity of secret sharing schemes by linear programming

This page was built for publication: Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533769)