On the information rate of perfect secret sharing schemes

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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. © 1994 IEEE.
Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
DOIs
Publication statusPublished - 1994
Externally publishedYes
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - , Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'On the information rate of perfect secret sharing schemes'. Together they form a unique fingerprint.

Cite this