Eprints of Rényi Institute

Optimal information rate of secret sharing schemes on trees

Csirmaz, László and Tardos, Gábor (2012) Optimal information rate of secret sharing schemes on trees. Information Theory, IEEE Transactions on . ISSN 0018-9448 (In Press)

This is the latest version of this item.

[img]
Preview
PDF
144Kb

Abstract

The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is (2-1/c)^{-1}, where c is the size of the largest core of the tree. A subset of the vertices of a tree is a core if it induces a connected subgraph and for each vertex in the subset one finds a neighbor outside the subset. Our result follows from a lower and an upper bound on the information rate that applies for any graph and happen to coincide for trees because of a correspondence between the size of the largest core and a quantity related to a fractional cover of the tree with stars.

Item Type:Article
Keywords and phrases:Secret sharing, fractional packing, graph, entropy method
Subjects:94A60 Cryptography
94A17 Measures of information, entropy
94A62 Authentication and secret sharing
Divisions:Research Groups > Theoretical cryptography
Last Modified:02 Mar 2013 20:53

Available Versions of this Item

Repository Staff Only: item control page