Secret sharing on the $d$-dimensional cube

Laszlo Csirmaz

Paper 2005/177 Original: eprint.iacr.org/2005/177 ↗

Secret sharing on the $d$-dimensional cube

Laszlo Csirmaz

Abstract

We prove that for $d>1$ the information rate of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $2/d$. Using the technique developed, we also prove that the information rate of the infinite $d$-dimensional lattice is $1/d$.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
History: 2005-06-14: last updated; 2005-06-14: published
Short URL: https://ia.cr/2005/177
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/177,
      author = {Laszlo Csirmaz},
      title = {Secret sharing on the $d$-dimensional cube},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/177},
      year = {2005},
      url = {https://eprint.iacr.org/2005/177}
}