Cryptology ePrint Archive: Report 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$.

Category / Keywords: foundations / Secret sharing scheme, polymatroid, information theory

Date: received 13 Jun 2005

Contact author: laci at degas ceu hu

Available format(s): PDF | BibTeX Citation

Version: 20050614:072212 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]