On the information rate of perfect secret sharing schemes

M. Dijk, van

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

Samenvatting

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.
Originele taal-2Engels
Titel1994 IEEE International Symposium on Information Theory (ISIT 1994, Trondheim, Norway, June 27-July 1, 1994)
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's489
ISBN van geprinte versie0-7803-2015-8
DOI's
StatusGepubliceerd - 1994

Citeer dit