Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
The Symmetric Two-Hop Channel with an Untrusted Relay
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems Engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems Engineering.ORCID iD: 0000-0002-3267-5374
2019 (English)In: Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018, Institute of Electrical and Electronics Engineers Inc. , 2019, p. 673-677Conference paper, Published paper (Refereed)
Abstract [en]

We study, using information-theoretic security methods, the so-called symmetric two-hop channel with an untrusted relay. In this model, a source wants to send its message reliably and securely to the destination through an honest but curious relay. The relay acts as a passive eavesdropper. Our investigation, in line with the relevant literature, seeks to determine what rate, termed secrecy rate, is achievable. To do that, we consider a typical setting, with the destination cooperating with the source, sending a 'scrambling' signal to conceal the message from the relay. To derive the achievable secrecy rate, we propose a novel scheme based on nested lattice codes. We show that our scheme outperforms all existing schemes and it achieves the outer bound for this channel model within 0.33 bits.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2019. p. 673-677
Keywords [en]
Achievable secrecy rates, Channel model, Information- theoretic securities, Nested lattice codes, Outer bounds, Passive eavesdroppers, Untrusted relays, Information theory
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-252220DOI: 10.23919/ISITA.2018.8664257ISI: 000468678100138Scopus ID: 2-s2.0-85063910251ISBN: 9784885523182 (print)OAI: oai:DiVA.org:kth-252220DiVA, id: diva2:1322944
Conference
15th International Symposium on Information Theory and Its Applications, ISITA 2018, 28 October 2018 through 31 October 2018
Note

QC 20190611

Available from: 2019-06-11 Created: 2019-06-11 Last updated: 2019-08-02Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Ghasemi-Goojani, ShahabPapadimitratos, Panagiotis

Search in DiVA

By author/editor
Ghasemi-Goojani, ShahabPapadimitratos, Panagiotis
By organisation
Network and Systems Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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