Information Rates for Secret Sharing over Various Access Structures.

Secret Sharing;Vamos Matroid;Information Inequalities;Access Structure;Information Rate;Shannon Entropy;Mathematics;Science;Mathematics

Metcalf-Burton, Jessica RuthHochster, Melvin ;

University of Michigan

关键词: Secret Sharing;    Vamos Matroid;    Information Inequalities;    Access Structure;    Information Rate;    Shannon Entropy;    Mathematics;    Science;    Mathematics;   

Others  :  https://deepblue.lib.umich.edu/bitstream/handle/2027.42/63729/jmetcalf_1.pdf?sequence=1&isAllowed=y

瑞士|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Many open questions in secret sharing ask about the information rate of a particular access structure or class of access structures.Here we improve the best known upper bounds on the information rates of the access structures induced by the Vamos matroid from 10/11 to 8/9 for V1 and from 9/10 to 17/19 for V6.The method we introduce to obtain the bound for V6 can be generalized and applied to all other known 4-variable non-Shannon information inequalities.We also find the exact information rates for the infinitely many minor-minimal, non-matroid-related access structures whose rates were not previously known.On the topic of information inequalities, we show that the Ingleton inequality holds under certain independence assumptions and use this formulation to get a new proof of the Zhang-Yeung non-Shannon inequality.