kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multi-terminal Strong Coordination over Noisy Channels with Secrecy Constraints
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0003-4237-6949
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-0036-9049
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2024 (English)In: 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE) , 2024, p. 1925-1930Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the problem of secure multi-terminal strong coordination aided by a multiple-access wiretap channel (MAC-WT). In this setup, independent and identically distributed (i.i.d.) copies of correlated sources are observed by two transmitters who encode the channel inputs to the MAC-WT. The legitimate receiver on observing the channel output must produce approximately i.i.d. copies of an output random variable jointly distributed with the two sources. Furthermore, we demand that an external eavesdropper learns essentially nothing about the sources and the simulated output sequence by observing its corresponding MAC-WT output. This is aided by the presence of independent pairwise shared randomness between each encoder and the legitimate decoder. The shared randomness rate tuples which permit such channel simulation with strong secrecy are of interest. We derive an achievable rate region based on a combination of coordination coding and wiretap coding, along with an outer bound. The inner bound is shown to be tight and a complete characterization is derived for the special case when the sources are independent and the legitimate receiver's channel is composed of deterministic links.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2024. p. 1925-1930
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-353517DOI: 10.1109/ISIT57864.2024.10619089Scopus ID: 2-s2.0-85202798870OAI: oai:DiVA.org:kth-353517DiVA, id: diva2:1899192
Conference
2024 IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, Jul 7 2024 - Jul 12 2024
Note

Part of ISBN 9798350382846

QC 20240919

Available from: 2024-09-19 Created: 2024-09-19 Last updated: 2024-09-19Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Ramachandran, ViswanathanOechtering, Tobias J.Skoglund, Mikael

Search in DiVA

By author/editor
Ramachandran, ViswanathanOechtering, Tobias J.Skoglund, Mikael
By organisation
Information Science and Engineering
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf