Secret sharing on the $d$-dimensional cube

Laszlo Csirmaz

Paper 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: Published elsewhere. Unknown where it was published
Keywords: Secret sharing scheme polymatroid information theory
Contact author(s): laci @ degas ceu hu
History: 2005-06-14: received
Short URL: https://ia.cr/2005/177
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2005/177}},
      url = {https://eprint.iacr.org/2005/177}
}