Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1204.2922 · IEEE Information Theory Workshop (ITW)

Secret key agreement using correlated sources over the generalized multiple access channel

Somayeh Salimi, Mikael Skoglund

Published Sep 1, 2012• 4 citations
arXivHTMLPDF

Abstract

A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between the users. The secret key agreement is established using the correlated sources and the GDMMAC. In this setup, inner and outer bounds of the secret key capacity region are investigated. Moreover, for a special case where the channel inputs and outputs and the sources form Markov chains in some order, the secret key capacity region is derived. Also a Gaussian case is considered in this setup.

DOI
10.1109/itw.2012.6404717

Related papers

Key Agreement over a Generalized Multiple Access Channel Using Noiseless and Noisy Feedback

Somayeh Salimi, Mikael Skoglund, Jovan Dj. Golić +2 more

A secret key agreement framework involving three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a feedback channel from user 3 to users 1 and 2 through which user 3 sends information extracted from the received output from the GDMMAC to increase the key rates. We consider both noiseless and noisy feedback. In the case of noiseless feedback, a public channel of unlimited capacity from user 3 to users 1 and 2 is used only once. In the case of noisy feedback, a noisy broadcast channel (BC) from user 3 to users 1 and 2 can be repeatedly used, like GDMMAC. In both setups, inner bounds of the secret key capacity region are derived. The secret key capacity region is derived in some special cases where the channel inputs and outputs form Markov chains in certain orders. For illustration, the corresponding results are also derived and discussed for Gaussian channels. The cases with noiseless feedback, noisy feedback, and no feedback at all are compared with each other.

IEEE Journal on Selected Areas in Communications•Aug 23, 2013•11 citations

Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels

Somayeh Salimi, Mikael Skoglund, Mahmoud Salmasizadeh +1 more

A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derived. Moreover, for a special case where the channel inputs and outputs of the GDMAC and the BC form Markov chains in some order, the secret key capacity region is derived. Also the results are discussed through a binary example.

arXiv:1202.1387•Feb 7, 2012•0 citations

Key agreement over multiple access channel using feedback channel

Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref

In this paper, the effect of using an insecure and noiseless feedback channel in increasing secret key rates is investigated. There is a generalized discrete memoryless multiple access channel (GDMMAC) between two transmitters and a receiver where, in addition to the receiver, both of the transmitters receive noisy channel outputs. Furthermore, an insecure and noiseless feedback channel exists from the receiver to the transmitters. Each of the transmitters intends to share a secret key with the receiver while keeping it concealed from the other transmitter. For this setup, an inner bound of the secret key capacity region is derived. For some special cases, the secret key capacity region is obtained, and the effect of the feedback channel usage is discussed through a binary-erasure example as well as in the Gaussian case.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•6 citations

Pairwise Key Agreement over a Generalized Multiple Access Channel: Capacity Bounds and Game-Theoretic Analysis

Somayeh Salimi, Frédéric Gabry, Mikael Skoglund

A pairwise key agreement between three users is considered in which each pair of the users wishes to agree on a secret key hidden from the remaining user. The three users communicate through a noisy channel where two users transmit the channel inputs and all the three users receive noisy outputs from the channel. In this setup, inner and outer bounds of the secret key capacity region are derived as well as a special case where the two bounds match. Furthermore, an achievable secret key rate region is derived for AWGN channels. In this Gaussian setup, we investigate the interaction between the two transmitting users from a game-theoretic perspective and we analyze the Nash equilibrium of the non-cooperative game considering two strategies for the transmitting users: power control and cooperative jamming. Finally we illustrate our results through numerical simulations.

International Symposium on Wireless Communication Systems•Oct 15, 2013•1 citation

Pairwise secret key agreement using the source common randomness

Somayeh Salimi, Mikael Skoglund, Mahmoud Salmasizadeh +1 more

A secret key agreement setup between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. The three users observe i.i.d. outputs of correlated sources and there is a noiseless public channel from each user for communication to the others. In this setup, inner and outer bounds of the secret key capacity region is derived. Moreover, some special cases are obtained in which the inner bound coincides the explicit outer bound. Also a binary-erasure example is presented through which the results are examined.

International Symposium on Wireless Communication Systems•Aug 1, 2012•3 citations

Strong Secrecy in Pairwise Key Agreement over a Generalized Multiple Access Channel

Somayeh Salimi, Matthieu R. Bloch, Frédéric Gabry +2 more

This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a "pre-generated" key-agreement scheme based on secrecy codes for the generalized MAC, in which the channel is only used to distribute pre-generated secret keys. We then extend this scheme to include an additional layer of rate-limited secret-key generation by treating the observed channel outputs as induced sources. We characterize inner and outer bounds on the strong secret-key capacity region for both schemes. For a special case of the "pre-generated" scheme, we obtain an exact characterization. We also illustrate with some binary examples that exploiting the generalized nature of the generalized MAC may lead to significantly larger key-agreement rates.

arXiv:1603.05399•Mar 17, 2016•0 citations
A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between the users. The secret key agreement is established using the correlated sources and the GDMMAC. In this setup, inner and outer bounds of the secret key capacity region are investigated. Moreover, for a special case where the channel inputs and outputs and the sources form Markov chains in some order, the secret key capacity region is derived. Also a Gaussian case is considered in this setup.
A secret key agreement framework involving three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a feedback channel from user 3 to users 1 and 2 through which user 3 sends information extracted from the received output from the GDMMAC to increase the key rates. We consider both noiseless and noisy feedback. In the case of noiseless feedback, a public channel of unlimited capacity from user 3 to users 1 and 2 is used only once. In the case of noisy feedback, a noisy broadcast channel (BC) from user 3 to users 1 and 2 can be repeatedly used, like GDMMAC. In both setups, inner bounds of the secret key capacity region are derived. The secret key capacity region is derived in some special cases where the channel inputs and outputs form Markov chains in certain orders. For illustration, the corresponding results are also derived and discussed for Gaussian channels. The cases with noiseless feedback, noisy feedback, and no feedback at all are compared with each other.
A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derived. Moreover, for a special case where the channel inputs and outputs of the GDMAC and the BC form Markov chains in some order, the secret key capacity region is derived. Also the results are discussed through a binary example.
In this paper, the effect of using an insecure and noiseless feedback channel in increasing secret key rates is investigated. There is a generalized discrete memoryless multiple access channel (GDMMAC) between two transmitters and a receiver where, in addition to the receiver, both of the transmitters receive noisy channel outputs. Furthermore, an insecure and noiseless feedback channel exists from the receiver to the transmitters. Each of the transmitters intends to share a secret key with the receiver while keeping it concealed from the other transmitter. For this setup, an inner bound of the secret key capacity region is derived. For some special cases, the secret key capacity region is obtained, and the effect of the feedback channel usage is discussed through a binary-erasure example as well as in the Gaussian case.
A pairwise key agreement between three users is considered in which each pair of the users wishes to agree on a secret key hidden from the remaining user. The three users communicate through a noisy channel where two users transmit the channel inputs and all the three users receive noisy outputs from the channel. In this setup, inner and outer bounds of the secret key capacity region are derived as well as a special case where the two bounds match. Furthermore, an achievable secret key rate region is derived for AWGN channels. In this Gaussian setup, we investigate the interaction between the two transmitting users from a game-theoretic perspective and we analyze the Nash equilibrium of the non-cooperative game considering two strategies for the transmitting users: power control and cooperative jamming. Finally we illustrate our results through numerical simulations.
A secret key agreement setup between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. The three users observe i.i.d. outputs of correlated sources and there is a noiseless public channel from each user for communication to the others. In this setup, inner and outer bounds of the secret key capacity region is derived. Moreover, some special cases are obtained in which the inner bound coincides the explicit outer bound. Also a binary-erasure example is presented through which the results are examined.
This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a "pre-generated" key-agreement scheme based on secrecy codes for the generalized MAC, in which the channel is only used to distribute pre-generated secret keys. We then extend this scheme to include an additional layer of rate-limited secret-key generation by treating the observed channel outputs as induced sources. We characterize inner and outer bounds on the strong secret-key capacity region for both schemes. For a special case of the "pre-generated" scheme, we obtain an exact characterization. We also illustrate with some binary examples that exploiting the generalized nature of the generalized MAC may lead to significantly larger key-agreement rates.