[Resource Topic] 2005/177: Secret sharing on the $d$-dimensional cube

Welcome to the resource topic for 2005/177

Secret sharing on the d-dimensional cube

Authors: Laszlo Csirmaz


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.

ePrint: https://eprint.iacr.org/2005/177

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .