Secrecy capacity region of binary and Gaussian multiple access channels

Yingbin Liang; H. Vincent Poor

Secrecy capacity region of binary and Gaussian multiple access channels

Yingbin Liang, H. Vincent Poor

Department of Electrical Engineering & Computer Science

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

2 Scopus citations

Abstract

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studied, and the capacityequivocation region and the secrecy capacity region are obtained. Two main classes of the GMAC are then studied: the binary GMAC and the Gaussian GMAC. For both channels, the capacity-equivocation region and the secrecy capacity region are established.

Original language	English (US)
Title of host publication	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Publisher	University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages	1098-1106
Number of pages	9
ISBN (Electronic)	9781604237924
State	Published - 2006
Event	44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States Duration: Sep 27 2006 → Sep 29 2006

Publication series

Name	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume	3

Other

Other	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Country/Territory	United States
City	Monticello
Period	9/27/06 → 9/29/06

ASJC Scopus subject areas

Computer Science Applications
Computer Networks and Communications

Cite this

Liang, Y., & Vincent Poor, H. (2006). Secrecy capacity region of binary and Gaussian multiple access channels. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006 (pp. 1098-1106). (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 3). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Secrecy capacity region of binary and Gaussian multiple access channels. / Liang, Yingbin; Vincent Poor, H.
44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. p. 1098-1106 (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 3).

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

Liang, Y & Vincent Poor, H 2006, Secrecy capacity region of binary and Gaussian multiple access channels. in 44th Annual Allerton Conference on Communication, Control, and Computing 2006. 44th Annual Allerton Conference on Communication, Control, and Computing 2006, vol. 3, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 1098-1106, 44th Annual Allerton Conference on Communication, Control, and Computing 2006, Monticello, United States, 9/27/06.

Liang Y, Vincent Poor H. Secrecy capacity region of binary and Gaussian multiple access channels. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2006. p. 1098-1106. (44th Annual Allerton Conference on Communication, Control, and Computing 2006).

Liang, Yingbin ; Vincent Poor, H. / Secrecy capacity region of binary and Gaussian multiple access channels. 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. pp. 1098-1106 (44th Annual Allerton Conference on Communication, Control, and Computing 2006).

@inproceedings{b51fbc8145a048ad8aa7d77935d87da8,

title = "Secrecy capacity region of binary and Gaussian multiple access channels",

abstract = "A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studied, and the capacityequivocation region and the secrecy capacity region are obtained. Two main classes of the GMAC are then studied: the binary GMAC and the Gaussian GMAC. For both channels, the capacity-equivocation region and the secrecy capacity region are established.",

author = "Yingbin Liang and {Vincent Poor}, H.",

year = "2006",

language = "English (US)",

series = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

pages = "1098--1106",

booktitle = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

note = "44th Annual Allerton Conference on Communication, Control, and Computing 2006 ; Conference date: 27-09-2006 Through 29-09-2006",

}

TY - GEN

T1 - Secrecy capacity region of binary and Gaussian multiple access channels

AU - Liang, Yingbin

AU - Vincent Poor, H.

PY - 2006

Y1 - 2006

N2 - A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studied, and the capacityequivocation region and the secrecy capacity region are obtained. Two main classes of the GMAC are then studied: the binary GMAC and the Gaussian GMAC. For both channels, the capacity-equivocation region and the secrecy capacity region are established.

AB - A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studied, and the capacityequivocation region and the secrecy capacity region are obtained. Two main classes of the GMAC are then studied: the binary GMAC and the Gaussian GMAC. For both channels, the capacity-equivocation region and the secrecy capacity region are established.

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

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

M3 - Conference contribution

AN - SCOPUS:84940657766

T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

SP - 1098

EP - 1106

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

Y2 - 27 September 2006 through 29 September 2006

ER -

Secrecy capacity region of binary and Gaussian multiple access channels

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this