Welcome to the resource topic for 2007/355
Title:
Secret sharing on the infinite ladder
Authors: Laszlo Csirmaz
Abstract:The notion of perfect secret sharing scheme has been extended to encompass infinite access structures, in particular infinite graphs. The participants are the vertices of the graph G and the edges are the minimal qualified subsets. The information ratio (the inverse of the information rate) of G is the largest lower bound on the amount of information by secret bits some vertex must receive in each scheme realizing this access structure. We show that this value is 7/4 for the infinite ladder, solving an open problem from. We give bounds for other infinite graphs as well.
ePrint: https://eprint.iacr.org/2007/355
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .