Optimal information rate of secret sharing schemes on trees

László Csirmaz, G. Tardos

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 , where 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.

Original languageEnglish
Article number6399598
Pages (from-to)2527-2530
Number of pages4
JournalIEEE Transactions on Information Theory
Volume59
Issue number4
DOIs
Publication statusPublished - Apr 2013

Fingerprint

Stars
Values

Keywords

  • Entropy method
  • Fractional packing and cover
  • Graph
  • Information rate
  • Secret sharing scheme

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Optimal information rate of secret sharing schemes on trees. / Csirmaz, László; Tardos, G.

In: IEEE Transactions on Information Theory, Vol. 59, No. 4, 6399598, 04.2013, p. 2527-2530.

Research output: Contribution to journalArticle

@article{b8231c8b4d1a475fb6a78a1fe795b6b0,
title = "Optimal information rate of secret sharing schemes on trees",
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 , where 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.",
keywords = "Entropy method, Fractional packing and cover, Graph, Information rate, Secret sharing scheme",
author = "L{\'a}szl{\'o} Csirmaz and G. Tardos",
year = "2013",
month = "4",
doi = "10.1109/TIT.2012.2236958",
language = "English",
volume = "59",
pages = "2527--2530",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Optimal information rate of secret sharing schemes on trees

AU - Csirmaz, László

AU - Tardos, G.

PY - 2013/4

Y1 - 2013/4

N2 - 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 , where 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.

AB - 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 , where 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.

KW - Entropy method

KW - Fractional packing and cover

KW - Graph

KW - Information rate

KW - Secret sharing scheme

UR - http://www.scopus.com/inward/record.url?scp=84896845807&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896845807&partnerID=8YFLogxK

U2 - 10.1109/TIT.2012.2236958

DO - 10.1109/TIT.2012.2236958

M3 - Article

VL - 59

SP - 2527

EP - 2530

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

M1 - 6399598

ER -