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.
|Title of host publication||1994 IEEE International Symposium on Information Theory (ISIT 1994, Trondheim, Norway, June 27-July 1, 1994)|
|Place of Publication||Piscataway|
|Publisher||Institute of Electrical and Electronics Engineers|
|Publication status||Published - 1994|