By Topic

On secret sharing communication systems with two or three channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:32 ,  Issue: 3 )