Secure Communication using an Untrusted Relay via Sources and Channels

被引：1

作者：

Milosavljevic, Nebojsa ^{[1
]}

Gastpar, Michael ^{[1
]}

Ramchandran, Kannan ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept EECS, Wireless Fdn Ctr, Berkeley, CA 94720 USA

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年

关键词：

COMMON RANDOMNESS; INFORMATION;

D O I：

10.1109/ISIT.2009.5206062

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Confidential communication aided by a relay without security clearance is studied. General strategies and outer bounds are derived for the problem of secret communication and secret key generation when correlated observations at all terminals are available. In a variation of the problem, it is assumed that the quality of the channel to the relay is known only to the relay. If the throughput-maximizing strategy is used according to the relay's claimed channel quality, the question is: what should the relay claim about the channel in order to maximize its eavesdropping capabilities? We propose a strategy that Alice and Bob may agree on in order to suppress any leakage of confidential communication between the source and the receiver.

引用

页码：2457 / 2461

页数：5

共 13 条

[1] COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].

AHLSWEDE, R ;

CSISZAR, I .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132

[2]

COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084

[3]

CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892

[4] Common randomness and secret key generation with a helper [J].

Csiszár, I ;

Narayan, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :344-366

[5]

EKREM E, ISIT 2008

[6]

HE X, ISIT 2008

[7]

HE X, ASILOMAR 2007

[8]

LAI L, 2006, IEEE T INF UNPUB DEC

[9]

MAURER UM, 1993, IEEE T INFORM THEORY, V39, P733, DOI 10.1109/18.256484

[10]

OOHAMA Y, 2006, IEEE T INF UNPUB NOV

← 1 2 →