Individual Secrecy for the Broadcast Channel

Yanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This paper studies the problem of secure communications over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage rate from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, and the framework of Marton's coding together with techniques, such as rate splitting and indirect decoding, an achievable individual secrecy rate region is established with the characterization of capacity regions for some special cases. In particular, the individual secrecy capacity region for the linear deterministic model is fully characterized, and for the Gaussian model, a constant gap (i.e., 0.5 b within the individual secrecy capacity region) result is obtained. To illustrate the impact of different secrecy constraints on the corresponding capacity regions, comparisons are made with those satisfying joint secrecy and without secrecy constraints. Overall, when compared with the joint secrecy constraint, the results allow for trading off secrecy level and throughput in the system.

Original languageEnglish (US)
Article number7902110
Pages (from-to)5981-5999
Number of pages19
JournalIEEE Transactions on Information Theory
Volume63
Issue number9
DOIs
StatePublished - Sep 1 2017

Fingerprint

secrecy
broadcast
Decoding
Transmitters
Throughput
coding
linear model
communications
Secure communication
recipient

Keywords

  • Broadcast channel
  • capacity region
  • reliability
  • secrecy

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Individual Secrecy for the Broadcast Channel. / Chen, Yanling; Koyluoglu, Onur Ozan; Sezgin, Aydin.

In: IEEE Transactions on Information Theory, Vol. 63, No. 9, 7902110, 01.09.2017, p. 5981-5999.

Research output: Contribution to journalArticle

Chen, Yanling ; Koyluoglu, Onur Ozan ; Sezgin, Aydin. / Individual Secrecy for the Broadcast Channel. In: IEEE Transactions on Information Theory. 2017 ; Vol. 63, No. 9. pp. 5981-5999.
@article{150d454d33474abe84ffbea75237ed42,
title = "Individual Secrecy for the Broadcast Channel",
abstract = "This paper studies the problem of secure communications over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage rate from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, and the framework of Marton's coding together with techniques, such as rate splitting and indirect decoding, an achievable individual secrecy rate region is established with the characterization of capacity regions for some special cases. In particular, the individual secrecy capacity region for the linear deterministic model is fully characterized, and for the Gaussian model, a constant gap (i.e., 0.5 b within the individual secrecy capacity region) result is obtained. To illustrate the impact of different secrecy constraints on the corresponding capacity regions, comparisons are made with those satisfying joint secrecy and without secrecy constraints. Overall, when compared with the joint secrecy constraint, the results allow for trading off secrecy level and throughput in the system.",
keywords = "Broadcast channel, capacity region, reliability, secrecy",
author = "Yanling Chen and Koyluoglu, {Onur Ozan} and Aydin Sezgin",
year = "2017",
month = "9",
day = "1",
doi = "10.1109/TIT.2017.2694552",
language = "English (US)",
volume = "63",
pages = "5981--5999",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Individual Secrecy for the Broadcast Channel

AU - Chen, Yanling

AU - Koyluoglu, Onur Ozan

AU - Sezgin, Aydin

PY - 2017/9/1

Y1 - 2017/9/1

N2 - This paper studies the problem of secure communications over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage rate from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, and the framework of Marton's coding together with techniques, such as rate splitting and indirect decoding, an achievable individual secrecy rate region is established with the characterization of capacity regions for some special cases. In particular, the individual secrecy capacity region for the linear deterministic model is fully characterized, and for the Gaussian model, a constant gap (i.e., 0.5 b within the individual secrecy capacity region) result is obtained. To illustrate the impact of different secrecy constraints on the corresponding capacity regions, comparisons are made with those satisfying joint secrecy and without secrecy constraints. Overall, when compared with the joint secrecy constraint, the results allow for trading off secrecy level and throughput in the system.

AB - This paper studies the problem of secure communications over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage rate from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, and the framework of Marton's coding together with techniques, such as rate splitting and indirect decoding, an achievable individual secrecy rate region is established with the characterization of capacity regions for some special cases. In particular, the individual secrecy capacity region for the linear deterministic model is fully characterized, and for the Gaussian model, a constant gap (i.e., 0.5 b within the individual secrecy capacity region) result is obtained. To illustrate the impact of different secrecy constraints on the corresponding capacity regions, comparisons are made with those satisfying joint secrecy and without secrecy constraints. Overall, when compared with the joint secrecy constraint, the results allow for trading off secrecy level and throughput in the system.

KW - Broadcast channel

KW - capacity region

KW - reliability

KW - secrecy

UR - http://www.scopus.com/inward/record.url?scp=85029488695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029488695&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2694552

DO - 10.1109/TIT.2017.2694552

M3 - Article

VL - 63

SP - 5981

EP - 5999

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 7902110

ER -