Optimal Information Rate of Secret Sharing Schemes on Trees

DOI10.1109/TIT.2012.2236958zbMath1364.94576arXiv1302.4609OpenAlexW1987772082MaRDI QIDQ2989337

Gábor Tardos, László Csirmaz

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Related Items (17)

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ Secret-sharing schemes for very dense graphs ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Secret sharing on large girth graphs ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Bipartite secret sharing and staircases ⋮ Secret sharing on regular bipartite access structures ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ On the information ratio of graphs without high-degree neighbors ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Secret sharing on the \(d\)-dimensional cube ⋮ Succinct computational secret sharing ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ Unnamed Item

This page was built for publication: Optimal Information Rate of Secret Sharing Schemes on Trees