Collective Secrecy over the K-Transmitter Multiple Access Channel

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. 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 submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.

Original languageEnglish (US)
JournalIEEE Transactions on Information Forensics and Security
DOIs
StateAccepted/In press - Mar 20 2018
Externally publishedYes

Fingerprint

Transmitters
Entropy

Keywords

  • Decoding
  • Electronic mail
  • Entropy
  • Receivers
  • Reliability
  • Standards
  • Transmitters

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

Collective Secrecy over the K-Transmitter Multiple Access Channel. / Chen, Yanling; Koyluoglu, Onur Ozan; Vinck, A. J.H.

In: IEEE Transactions on Information Forensics and Security, 20.03.2018.

Research output: Contribution to journalArticle

@article{6021d7fac2f342d991b7d6daa259fe64,
title = "Collective Secrecy over the K-Transmitter Multiple Access Channel",
abstract = "This paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. 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 submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.",
keywords = "Decoding, Electronic mail, Entropy, Receivers, Reliability, Standards, Transmitters",
author = "Yanling Chen and Koyluoglu, {Onur Ozan} and Vinck, {A. J.H.}",
year = "2018",
month = "3",
day = "20",
doi = "10.1109/TIFS.2018.2818067",
language = "English (US)",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Collective Secrecy over the K-Transmitter Multiple Access Channel

AU - Chen, Yanling

AU - Koyluoglu, Onur Ozan

AU - Vinck, A. J.H.

PY - 2018/3/20

Y1 - 2018/3/20

N2 - This paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. 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 submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.

AB - This paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. 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 submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.

KW - Decoding

KW - Electronic mail

KW - Entropy

KW - Receivers

KW - Reliability

KW - Standards

KW - Transmitters

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

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

U2 - 10.1109/TIFS.2018.2818067

DO - 10.1109/TIFS.2018.2818067

M3 - Article

AN - SCOPUS:85044319033

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

ER -