On secure communication over the multiple access channel

Yanling Chen, Onur Ozan Koyluoglu, A. J Han Vinck

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper is made vanishing). As a general result, the respective achievable secrecy rate regions are established. The single-letter characterizations of both regions involve three auxiliary random variables, one for time sharing and two for channel prefixing. Numerical results are presented to demonstrate the impact of different secrecy constraints and the advantage of channel prefixing in enlarging the achievable (individual/joint) secrecy rate regions.

Original languageEnglish (US)
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages350-354
Number of pages5
ISBN (Electronic)9784885523090
StatePublished - Feb 2 2017
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: Oct 30 2016Nov 2 2016

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period10/30/1611/2/16

Fingerprint

secrecy
Random variables
Transmitters
communication
Secure communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Cite this

Chen, Y., Koyluoglu, O. O., & Vinck, A. J. H. (2017). On secure communication over the multiple access channel. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 350-354). [7840444] Institute of Electrical and Electronics Engineers Inc..

On secure communication over the multiple access channel. / Chen, Yanling; Koyluoglu, Onur Ozan; Vinck, A. J Han.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 350-354 7840444.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, Y, Koyluoglu, OO & Vinck, AJH 2017, On secure communication over the multiple access channel. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840444, Institute of Electrical and Electronics Engineers Inc., pp. 350-354, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 10/30/16.
Chen Y, Koyluoglu OO, Vinck AJH. On secure communication over the multiple access channel. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 350-354. 7840444
Chen, Yanling ; Koyluoglu, Onur Ozan ; Vinck, A. J Han. / On secure communication over the multiple access channel. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 350-354
@inproceedings{6031545d49944799a74707cddc74efc9,
title = "On secure communication over the multiple access channel",
abstract = "This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper is made vanishing). As a general result, the respective achievable secrecy rate regions are established. The single-letter characterizations of both regions involve three auxiliary random variables, one for time sharing and two for channel prefixing. Numerical results are presented to demonstrate the impact of different secrecy constraints and the advantage of channel prefixing in enlarging the achievable (individual/joint) secrecy rate regions.",
author = "Yanling Chen and Koyluoglu, {Onur Ozan} and Vinck, {A. J Han}",
year = "2017",
month = "2",
day = "2",
language = "English (US)",
pages = "350--354",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - On secure communication over the multiple access channel

AU - Chen, Yanling

AU - Koyluoglu, Onur Ozan

AU - Vinck, A. J Han

PY - 2017/2/2

Y1 - 2017/2/2

N2 - This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper is made vanishing). As a general result, the respective achievable secrecy rate regions are established. The single-letter characterizations of both regions involve three auxiliary random variables, one for time sharing and two for channel prefixing. Numerical results are presented to demonstrate the impact of different secrecy constraints and the advantage of channel prefixing in enlarging the achievable (individual/joint) secrecy rate regions.

AB - This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper is made vanishing). As a general result, the respective achievable secrecy rate regions are established. The single-letter characterizations of both regions involve three auxiliary random variables, one for time sharing and two for channel prefixing. Numerical results are presented to demonstrate the impact of different secrecy constraints and the advantage of channel prefixing in enlarging the achievable (individual/joint) secrecy rate regions.

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

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

M3 - Conference contribution

SP - 350

EP - 354

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -