Paper 2007/355 Original: eprint.iacr.org/2007/355 ↗
Secret sharing on the infinite ladder
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2007-09-13: last updated
- 2007-09-13: published
- Short URL
- https://ia.cr/2007/355
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/355,
author = {Laszlo Csirmaz},
title = {Secret sharing on the infinite ladder},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/355},
year = {2007},
url = {https://eprint.iacr.org/2007/355}
}