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
Key Agreement over an Interference Channel with Noiseless Feedback: Achievable Region & Distributed Allocation
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-3267-5374
2015 (English)In: IEEE Conference on Communications and Network Security (CNS), Institute of Electrical and Electronics Engineers (IEEE), 2015, 59-64 p., 7346811Conference paper, Published paper (Refereed)
Abstract [en]

Secret key establishment leveraging the physical layer as a source of common randomness has been investigated in a range of settings. We investigate the problem of establishing, in an information-theoretic sense, a secret key between a user and a base-station (BS) (more generally, part of a wireless infrastructure), but for two such user-BS pairs attempting the key establishment simultaneously. The challenge in this novel setting lies in that a user can eavesdrop another BS-user communications. It is thus paramount to ensure the two keys are established with no leakage to the other user, in spite the interference across neighboring cells. We model the system with BS-user communication through an interference channel and user-BS communication through a public channel. We find the region including achievable secret key rates for the general case that the interference channel (IC) is discrete and memoryless. Our results are examined for a Gaussian IC. In this setup, we investigate the performance of different transmission schemes for power allocation. The chosen transmission scheme by each BS essentially affects the secret key rate of the other BS-user. Assuming base stations are trustworthy but that they seek to maximize the corresponding secret key rate, a game-theoretic setting arises to analyze the interaction between the base stations. We model our key agreement scenario in normal form for different power allocation schemes to understand performance without cooperation. Numerical simulations illustrate the inefficiency of the Nash equilibrium outcome and motivate further research on cooperative or coordinated schemes.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. 59-64 p., 7346811
Keyword [en]
Base stations, Cryptography, Game theory, Information theory, Integrated circuits, Network layers, Signal interference, Transmissions, Distributed allocation, Interference channels, Key establishments, Nash equilibrium outcome, Noiseless feedback, Transmission schemes, User communication, Wireless infrastructures
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-172912DOI: 10.1109/CNS.2015.7346811ISI: 000380401800009Scopus ID: 2-s2.0-84966318525OAI: oai:DiVA.org:kth-172912DiVA: diva2:850292
Conference
IEEE Conference on Communications and Network Security (CNS) 28-30 of september 2015
Note

QC 20160104

Available from: 2015-09-01 Created: 2015-09-01 Last updated: 2017-03-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusIEEE Conference on Communications and Network Security (CNS)

Authority records BETA

Skoglund, Mikael

Search in DiVA

By author/editor
Salimi, SomayehJorswieck, EduardSkoglund, MikaelPapadimitratos, Panos
By organisation
Communication NetworksCommunication TheoryACCESS Linnaeus Centre
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 74 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