International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Secret sharing on the $d$-dimensional cube

Authors:
Laszlo Csirmaz
Download:
URL: http://eprint.iacr.org/2005/177
Search ePrint
Search Google
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$.
BibTeX
@misc{eprint-2005-12513,
  title={Secret sharing on the $d$-dimensional cube},
  booktitle={IACR Eprint archive},
  keywords={foundations / Secret sharing scheme, polymatroid, information theory},
  url={http://eprint.iacr.org/2005/177},
  note={ laci@degas.ceu.hu 12947 received 13 Jun 2005},
  author={Laszlo Csirmaz},
  year=2005
}