Secrecy capacity region of binary and Gaussian multiple access channels

Yingbin Liang, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publication44th Annual Allerton Conference on Communication, Control, and Computing 2006
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1098-1106
Number of pages9
ISBN (Electronic)9781604237924
StatePublished - Jan 1 2006
Event44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States
Duration: Sep 27 2006Sep 29 2006

Publication series

Name44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume3

Other

Other44th Annual Allerton Conference on Communication, Control, and Computing 2006
CountryUnited States
CityMonticello
Period9/27/069/29/06

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Liang, Y., & Poor, H. V. (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.