Joint secrecy over the K-transmitter multiple access channel

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

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

1 Citation (Scopus)

Abstract

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.

Original languageEnglish (US)
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages394-398
Number of pages5
Volume2018-January
ISBN (Electronic)9781509030972
DOIs
StatePublished - Jan 31 2018
Externally publishedYes
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: Nov 6 2017Nov 10 2017

Other

Other2017 IEEE Information Theory Workshop, ITW 2017
CountryTaiwan, Province of China
CityKaohsiung
Period11/6/1711/10/17

Fingerprint

Multiple Access Channel
Transmitter
Transmitters
Entropy
Secure Communication
Partial Information
Mutual Information
Leakage
Elimination
Lemma
Secure communication
Context
Generalization
Standards

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Chen, Y., Koyluoglu, O. O., & Vinck, A. J. H. (2018). Joint secrecy over the K-transmitter multiple access channel. In 2017 IEEE Information Theory Workshop, ITW 2017 (Vol. 2018-January, pp. 394-398). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2017.8277932

Joint secrecy over the K-transmitter multiple access channel. / Chen, Yanling; Koyluoglu, Onur Ozan; Vinck, A. J.Han.

2017 IEEE Information Theory Workshop, ITW 2017. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. p. 394-398.

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

Chen, Y, Koyluoglu, OO & Vinck, AJH 2018, Joint secrecy over the K-transmitter multiple access channel. in 2017 IEEE Information Theory Workshop, ITW 2017. vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 394-398, 2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, Province of China, 11/6/17. https://doi.org/10.1109/ITW.2017.8277932
Chen Y, Koyluoglu OO, Vinck AJH. Joint secrecy over the K-transmitter multiple access channel. In 2017 IEEE Information Theory Workshop, ITW 2017. Vol. 2018-January. Institute of Electrical and Electronics Engineers Inc. 2018. p. 394-398 https://doi.org/10.1109/ITW.2017.8277932
Chen, Yanling ; Koyluoglu, Onur Ozan ; Vinck, A. J.Han. / Joint secrecy over the K-transmitter multiple access channel. 2017 IEEE Information Theory Workshop, ITW 2017. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. pp. 394-398
@inproceedings{30c903edb02645b6a1fd20ea83da2036,
title = "Joint secrecy over the K-transmitter multiple access channel",
abstract = "This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.",
author = "Yanling Chen and Koyluoglu, {Onur Ozan} and Vinck, {A. J.Han}",
year = "2018",
month = "1",
day = "31",
doi = "10.1109/ITW.2017.8277932",
language = "English (US)",
volume = "2018-January",
pages = "394--398",
booktitle = "2017 IEEE Information Theory Workshop, ITW 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Joint secrecy over the K-transmitter multiple access channel

AU - Chen, Yanling

AU - Koyluoglu, Onur Ozan

AU - Vinck, A. J.Han

PY - 2018/1/31

Y1 - 2018/1/31

N2 - This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.

AB - This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.

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

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

U2 - 10.1109/ITW.2017.8277932

DO - 10.1109/ITW.2017.8277932

M3 - Conference contribution

AN - SCOPUS:85046367546

VL - 2018-January

SP - 394

EP - 398

BT - 2017 IEEE Information Theory Workshop, ITW 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -