Ideal perfect threshold schemes and MDS codes

G. R. Blakley, G. A. Kabatianski

Research output: Contribution to conferencePaperpeer-review

29 Citations (Scopus)

Abstract

From the results of past studies on the relationship between threshold secret sharing schemes (SSS) and MDS codes, the equivalence of combinatorial ideal perfect threshold SSS and MDS codes follows almost immediately. This paper gives an independent, self-contained proof following the ideas of Karnin et al. (1983) for the formally more general information-theoretic definition of ideal SSS.

Original languageEnglish
Pages488
Number of pages1
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: 17 Sep 199522 Sep 1995

Conference

ConferenceProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period17/09/9522/09/95

Fingerprint

Dive into the research topics of 'Ideal perfect threshold schemes and MDS codes'. Together they form a unique fingerprint.

Cite this