An outer bound to the rate equivocation region of broadcast channels with two confidential messages

Jin Xu; Biao Chen

doi:10.1109/GLOCOM.2008.ECP.186

An outer bound to the rate equivocation region of broadcast channels with two confidential messages

Jin Xu, Biao Chen

Department of Electrical Engineering & Computer Science

Research output: Chapter in Book/Entry/Poem › Conference contribution

2 Scopus citations

Abstract

In this paper we study a generalization of Csiszár and Kiirner's broadcast channel with confidential messages. Specifically, we consider a two-user broadcast channel with one common message and two confidential messages, one for each receiver. We establish outer bounds to the rate equivocation region of this channel. Our proposed outer bounds, together with a recently proposed achievable region, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages. Furthermore, specializing to the general broadcast channel by removing the secrecy constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

Original language	English (US)
Title of host publication	2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Pages	941-945
Number of pages	5
DOIs	https://doi.org/10.1109/GLOCOM.2008.ECP.186
State	Published - 2008
Event	2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States Duration: Nov 30 2008 → Dec 4 2008

Publication series

Name	GLOBECOM - IEEE Global Telecommunications Conference

Other

Other	2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Country/Territory	United States
City	New Orleans, LA
Period	11/30/08 → 12/4/08

Keywords

Broadcast channel
Confidential message
Outer bound

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/GLOCOM.2008.ECP.186

Cite this

Xu, J & Chen, B 2008, An outer bound to the rate equivocation region of broadcast channels with two confidential messages. in 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008., 4697961, GLOBECOM - IEEE Global Telecommunications Conference, pp. 941-945, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 11/30/08. https://doi.org/10.1109/GLOCOM.2008.ECP.186

@inproceedings{be88010993b04b8892a8296355800443,

title = "An outer bound to the rate equivocation region of broadcast channels with two confidential messages",

abstract = "In this paper we study a generalization of Csisz{\'a}r and Kiirner's broadcast channel with confidential messages. Specifically, we consider a two-user broadcast channel with one common message and two confidential messages, one for each receiver. We establish outer bounds to the rate equivocation region of this channel. Our proposed outer bounds, together with a recently proposed achievable region, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages. Furthermore, specializing to the general broadcast channel by removing the secrecy constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.",

keywords = "Broadcast channel, Confidential message, Outer bound",

author = "Jin Xu and Biao Chen",

year = "2008",

doi = "10.1109/GLOCOM.2008.ECP.186",

language = "English (US)",

isbn = "9781424423248",

series = "GLOBECOM - IEEE Global Telecommunications Conference",

pages = "941--945",

booktitle = "2008 IEEE Global Telecommunications Conference, GLOBECOM 2008",

note = "2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 ; Conference date: 30-11-2008 Through 04-12-2008",

}

TY - GEN

T1 - An outer bound to the rate equivocation region of broadcast channels with two confidential messages

AU - Xu, Jin

AU - Chen, Biao

PY - 2008

Y1 - 2008

N2 - In this paper we study a generalization of Csiszár and Kiirner's broadcast channel with confidential messages. Specifically, we consider a two-user broadcast channel with one common message and two confidential messages, one for each receiver. We establish outer bounds to the rate equivocation region of this channel. Our proposed outer bounds, together with a recently proposed achievable region, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages. Furthermore, specializing to the general broadcast channel by removing the secrecy constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

AB - In this paper we study a generalization of Csiszár and Kiirner's broadcast channel with confidential messages. Specifically, we consider a two-user broadcast channel with one common message and two confidential messages, one for each receiver. We establish outer bounds to the rate equivocation region of this channel. Our proposed outer bounds, together with a recently proposed achievable region, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages. Furthermore, specializing to the general broadcast channel by removing the secrecy constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

KW - Broadcast channel

KW - Confidential message

KW - Outer bound

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

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

U2 - 10.1109/GLOCOM.2008.ECP.186

DO - 10.1109/GLOCOM.2008.ECP.186

M3 - Conference contribution

AN - SCOPUS:67249160188

SN - 9781424423248

T3 - GLOBECOM - IEEE Global Telecommunications Conference

SP - 941

EP - 945

BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008

T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008

Y2 - 30 November 2008 through 4 December 2008

ER -

An outer bound to the rate equivocation region of broadcast channels with two confidential messages

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this