Abstract
We present a method to derive information theoretical upper bounds on the information rate and average information rate of perfect secret sharing schemes. One of the applications is that in perfect secret sharing schemes for some access structures the shares need to be impractically large.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
| Publisher | IEEE |
| Publication status | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Duration: 27 Jun 1994 → 1 Jul 1994 |
Conference
| Conference | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| Period | 27/06/94 → 1/07/94 |