Coding for relay channels with confidential messages

Author

Oohama, Yasutada

Author_Institution

Graduate Sch. of Inf. Sci. & Electr. Eng., Kyushu Univ., Fukuoka, Japan

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

87

Lastpage

89

Abstract

We consider a relay channel where a relay helps the transmission of messages from one sender to one receiver. The relay is considered not only as a sender that helps the message transmission but as a wire-tapper who can obtain some knowledge about the transmitted messages. In this paper we study the coding problem of the relay channel under the situation that some of transmitted messages are confidential to the relay. A security of such confidential messages is measured by the conditional entropy. We derive an explicit inner bound of the capacity region characterized with the set of transmission rates for which messages are reliably transmitted and the security of confidential messages is larger than a prescribed level

Keywords

channel capacity; channel coding; entropy; telecommunication security; capacity region; coding problem; conditional entropy; confidential messages; inner bound; message transmission; multiuser information theory; relay channel; secure communication; security; wire-tapper; Codes; Communication channels; Communication system security; Communication systems; Entropy; Information science; Information security; Information theory; Public key cryptography; Relays;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2001. Proceedings. 2001 IEEE

Conference_Location

Cairns, Qld.

Print_ISBN

0-7803-7119-4

Type

conf

DOI

10.1109/ITW.2001.955145

Filename

955145