A CODING THEOREM FOR SECRET SHARING COMMUNICATION-SYSTEMS WITH 2 GAUSSIAN WIRETAP CHANNELS

被引：23

作者：

YAMAMOTO, H ^{[1
]}

机构：

[1] UNIV ELECTROCOMMUN,DEPT COMMUN & SYST,CHOFU,TOKYO 182,JAPAN

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

SECRET SHARING COMMUNICATION SYSTEM; WIRETAP CHANNEL; CODING THEOREM;

D O I：

10.1109/18.79919

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWC's is described by the capacities and secrecy capacities of two GWC's.

引用

页码：634 / 638

页数：5

共 6 条

[1] ON SECRET SHARING SYSTEMS [J].

KARNIN, ED ;

GREENE, JW ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :35-41

[2]

LEUNGYANCHEONG SK, 1978, IEEE T INFORM THEORY, V24, P451, DOI 10.1109/TIT.1978.1055917

[3] COMMUNICATION THEORY OF SECRECY SYSTEMS [J].

SHANNON, CE .

BELL SYSTEM TECHNICAL JOURNAL, 1949, 28 (04) :656-715

[4]

VANDERMEULEN EC, 1981, NEW CONCEPTS MULTIUS

[5] ON SECRET SHARING COMMUNICATION-SYSTEMS WITH 2 OR 3 CHANNELS [J].

YAMAMOTO, H .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (03) :387-393

[6] CODING THEOREM FOR SECRET SHARING COMMUNICATION-SYSTEMS WITH 2 NOISY CHANNELS [J].

YAMAMOTO, H .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (03) :572-578

← 1 →