Semi-Blind Key-Agreement over MIMO Fading Channels

Renna, Francesco; Bloch,; Laurenti, Nicola

doi:10.1109/icc.2011.5963438

Cited by 9 publications

(17 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we extend the results in [18] in two different ways. First of all, we consider the realistic case in which the eavesdropper channel is not perfectly known, and following a conservative worstcase approach, we show that the robust problem can be reformulated as a convex optimization problem.…”

Section: Introductionmentioning

confidence: 57%

“…Finally, we also consider the practical cases in which the eavesdropper channel estimate is very inaccurate or not even available. In these cases, the optimal power allocation is given by a waterfilling or matched filtering like solution, which constitutes an important difference with the results obtained in [18] for low and high SNRs.…”

Section: Introductionmentioning

confidence: 96%

“…However, from a signal processing perspective, most of the literature is focused on secrecy capacity issues [9][10][11], as well as other interesting topics such as authentication [12][13][14][15] or discriminatory channel estimation [16,17]. Thus, it is rather surprising that the signal processing approaches to secret key capacity (SKC) are really scarce [12,18]. In particular, [18] considers a MIMO Gaussian wiretap channel, complemented by a public authenticated channel, and the transmit covariance matrix is optimized in order to maximize the SKC, with some interesting insights in the case of low and high signal to noise ratios (SNRs).…”

Section: Introductionmentioning

confidence: 99%

“…Thus, it is rather surprising that the signal processing approaches to secret key capacity (SKC) are really scarce [12,18]. In particular, [18] considers a MIMO Gaussian wiretap channel, complemented by a public authenticated channel, and the transmit covariance matrix is optimized in order to maximize the SKC, with some interesting insights in the case of low and high signal to noise ratios (SNRs).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Robust secret key capacity for the MIMO induced source model

Vía

2014

2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

This paper considers the problem of distilling a secret key in a Gaussian multiple-input multiple-output (MIMO) scenario with two legitimate nodes and an eavesdropper. Focusing on the realistic case without perfect knowledge of the eavesdropper channel, and following a conservative practical approach based on the maximization of the worst case secret key capacity (SKC), the problem of designing the optimal transmit covariance matrix is reformulated as a convex optimization problem. In the limiting case in which the eavesdropper channel can not be estimated, or when the estimate is highly unreliable, the optimal covariance matrix can be obtained by means of waterfilling or matched filtering like algorithms. Additionally, we illustrate the benefits of allowing time sharing between transmissions of the two legitimate nodes, and provide an efficient algorithm for obtaining the optimal transmit covariance matrices and time-sharing factor.

show abstract

Section: Introductionmentioning

confidence: 57%

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Robust secret key capacity for the MIMO induced source model

Vía

2014

2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

show abstract

“…Its extension to continuous random sources has been considered in [8], while SKA among multiple terminals has been addressed in [5]. The asymptotic behavior at high and low power regimes of the secret key capacity over multiple input multiple output (MIMO) channels has been derived in [9]. The channel model provides a four-step procedure, by which Alice first transmits a sequence of random bits to Bob who performs detection.…”

mentioning

confidence: 99%

Resource Allocation for Secret Key Agreement Over Parallel Channels With Full and Partial Eavesdropper CSI

Tomasin

Dall’Arche²

2015

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

We consider the distillation phase of the secret key agreement (SKA) channel model for users connected through parallel additive white Gaussian noise fading channels. Alice sends binary phase shift keying modulated random bits to Bob who selects the subset of bits that have a log-likelihood ratio higher than a given threshold, i.e., they are sufficiently reliable. Alice has either full or partial channel state information (CSI) on her channel to the eavesdropper Eve. The main contributions of this paper are: 1) the derivation of the expression of outage probability when partial CSI is available; 2) the introduction of (outage) secret key throughput (SKT) as a metric in the full (partial) CSI scenario; 3) the derivation of SKT bounds; 4) the proposal of a new power allocation and threshold choice algorithm that maximizes the SKT under an outage probability constraint; and 5) the derivation of a suboptimal version of the allocation algorithm amenable for practical implementation obtained by approximating the objective functions with a closedform expression. Moreover, we show that when power allocation and thresholds are optimized, per-channel and joint SKA are equivalent.Index Terms-OFDM, physical layer security, resource allocation, secret key agreement.

show abstract

Secret Key Generation With Cross Multiplication of Two-Way Random Signals

et al. 2019

View full text Add to dashboard Cite

The secret key generation rate (SKGR) of current physical layer security methods is not high enough for practical requirements. A novel SKG method based on the cross multiplication (XM) of twoway random signals is proposed for TDD-MIMO system. The principle concealed beneath the XM method is found that the XM operation not only derives the common random source for both legitimate partners, but also employs new generated cross-terms due to bilinear operation to provide more measurements of the random source and more secret keys accordingly, which is essentially superior to the existing paired multiplication (PM) method. Then, the theoretical SKGR of two-way random signals is analyzed and it is validated that SKGR is determined by the randomness of the reciprocal channel and the two-way secure transmission rates collectively. Furthermore, SKGR of XM and PM methods are derived in closed-form respectively under infinite antenna condition and the former shows a linear increase with the channel coherence interval, which are also approximately valid for finite antenna. The innovative conclusion means the slow-changing property of some channel environments can be further exploited and the proposed XM method can be applied to solve the low SKGR problem in static or quasi-static channel environment such as IoT. Finally, the simulations verify the theoretical results and show that the XM method achieves several orders of magnitude higher SKGR than the PM method.

show abstract

Semi-Blind Key-Agreement over MIMO Fading Channels

Cited by 9 publications

References 21 publications

Robust secret key capacity for the MIMO induced source model

Robust secret key capacity for the MIMO induced source model

Resource Allocation for Secret Key Agreement Over Parallel Channels With Full and Partial Eavesdropper CSI

Secret Key Generation With Cross Multiplication of Two-Way Random Signals

Contact Info

Product

Resources

About