On the information rate of perfect secret sharing schemes

M. Dijk, van

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

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 languageEnglish
Title of host publication1994 IEEE International Symposium on Information Theory (ISIT 1994, Trondheim, Norway, June 27-July 1, 1994)
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages489
ISBN (Print)0-7803-2015-8
DOIs
Publication statusPublished - 1994

Cite this