L. Csirmaz:

Secret sharing in the d-dimensional cube

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.

Key words: Secret sharing scheme, polymatroid, information theory.