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:1512.08652

Pairwise Secret Key Agreement based on Location-derived Common Randomness

Somayeh Salimi, Panos Papadimitratos

Published Dec 29, 2015• 2 citations
arXivHTMLPDF

Abstract

A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are rate-limited public channels for communications between the users. We give an inner bound on the secret key capacity region in this framework. Moreover, we investigate a practical setup in which localization information of the users as the correlated observations are exploited to share pairwise keys between the users. The inner and outer bounds of the key capacity region are analyzed in this setup for the case of i.i.d. Gaussian observations.

DOI
10.3929/ethz-a-010646726

Related papers

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

Rate regions of secret key sharing in a new source model

Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref

A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, while at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. For both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, the results agree with that of Ahlswede and Csiszar. Also, the authors investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.

IET Communications•Mar 4, 2011•14 citations

Rate Regions of Secret Key Sharing in a New Source Model

Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref

A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.

arXiv:1004.0799•Apr 6, 2010•1 citation

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

Somayeh Salimi, Mikael Skoglund

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.

arXiv:1204.2922•IEEE Information Theory Workshop (ITW)•Sep 1, 2012•4 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

Secret key sharing in a new source model: Rate regions

Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref

A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via public channels where three users can observe i.i.d outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (forward key strategy) and from user 3 to users 1 and 2 (backward key strategy). This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special attitudes where one of users 1 and 2 are only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which inner bound coincides on outer bound and secret key capacity region is deduced.

Australian Communications Theory Workshop•Feb 1, 2010•6 citations
A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are rate-limited public channels for communications between the users. We give an inner bound on the secret key capacity region in this framework. Moreover, we investigate a practical setup in which localization information of the users as the correlated observations are exploited to share pairwise keys between the users. The inner and outer bounds of the key capacity region are analyzed in this setup for the case of i.i.d. Gaussian observations.
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.
A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, while at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. For both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, the results agree with that of Ahlswede and Csiszar. Also, the authors investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.
A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.
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 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 source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via public channels where three users can observe i.i.d outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (forward key strategy) and from user 3 to users 1 and 2 (backward key strategy). This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special attitudes where one of users 1 and 2 are only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which inner bound coincides on outer bound and secret key capacity region is deduced.