CryptoDB
Secret sharing on the infinite ladder
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2007-13635, title={Secret sharing on the infinite ladder}, booktitle={IACR Eprint archive}, keywords={foundations / secret sharing scheme; information theory; infinite graph; information rate}, url={http://eprint.iacr.org/2007/355}, note={ csirmaz@renyi.hu 13763 received 7 Sep 2007}, author={Laszlo Csirmaz}, year=2007 }