On secret sharing communication systems with two or three channels

  • Authors:
  • H Yamamoto

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1986

Quantified Score

Hi-index 754.84

Visualization

Abstract

The source coding problem is considered for secret sharing communication systems (SSCS's) with two or three channels. The SSCS, where the informationXis shared and communicated through two or more channels, is an extension of Sbannon's cipher communication system and the secret sharing system. The security level is measured with equivocation; that is,(1/N)H(X|W_{i}), (1/N)H(X|W_{i}W_{i}), etc., whereW_{i}andW_{j}are the wire-tapped codewords. The achievable rate region for the given security level is established for the SSCS's with two or three channels.