Secret sharing on the $d$-dimensional cube
Cryptography and Security
2013-10-18 v1 Combinatorics
Abstract
We prove that for the best information ratio of the perfect secret sharing scheme based on the edge set of the -dimensional cube is exactly . Using the technique developed, we also prove that the information ratio of the infinite -dimensional lattice is .
Cite
@article{arxiv.1310.4640,
title = {Secret sharing on the $d$-dimensional cube},
author = {Laszlo Csirmaz},
journal= {arXiv preprint arXiv:1310.4640},
year = {2013}
}