IEEE Conference on Communications and Network Security

A Gale-Shapley algorithm for allocation of relayed parallel wiretap coding channels

Stefano Tomasin

Published Sep 1, 2015• 6 citations

Abstract

Alice aims at transmitting Bob a message to be kept secret from Eve, with the assistance of relays operating in a decode-and-forward fashion. Each link between node couples comprises a set of parallel channels. Both Alice and relays knows all legitimate channel gains, while they only have a statistical knowledge of the channels to Eve. By fixing a secrecy outage probability per channel, we optimize power and rate of the messages sent by Alice to the relays (phase one) and from the relays to Bob (phase two), in order to maximize the achievable end-to-end outage secrecy rate. Since the phase-one rate cannot exceed the phase-two rate for each relay, the allocations in the two phases are tightly coupled, making the optimization quite challenging. Therefore we propose a solution based on the Gale-Shapley approach to the stable matching problem. The algorithm iterates between two stages, one in which each relay proposes Bob a secret rate on a specific channel, and another in which Bob discards the offer providing the lowest rate. The process is repeated until a single offer is available on each channel. Offers by the relays are based on (and in turns influence) the resource allocation by Alice with respect to her transmission to the relays. Numerical results are provided, showing the merit of the proposed solution with respect to existing approaches.

DOI: 10.1109/cns.2015.7346819

Related papers

Resource allocation for secure Gaussian parallel relay channels with finite-length coding and discrete constellations

Linda Senigagliesi, Marco Baldi, Stefano Tomasin

Abstract We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of efficient implementations, including discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then, we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee anoutagesecrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones.

arXiv:1807.06448EURASIP Journal on Wireless Communications and NetworkingDec 1, 20194 citations

Resource allocation for secret transmissions on parallel Rayleigh channels

Nicola Laurenti, Stefano Tomasin, Francesco Renna

A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All subchannels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.

International Conference on CommunicationsJun 1, 20148 citations

Resource allocation for secret transmissions over MIMOME fading channels

Stefano Tomasin

For a communication where agent Alice aims at transmitting to agent Bob a message which must be kept secret to a third agent Eve, we consider terminals equipped with multiple antennas, obtaining the multiple-input multiple-output multiple-output-eavesdropper (MIMOME) channel. In this scenario, we assume that Alice knows the instantaneous channel conditions of the Alice-Bob channel before transmission, while knowing only the statistics of the Alice-Eve channel. For Rayleigh fading channels there is a non-zero probability that Eve gets a better channel than Bob, thus obtaining some information on the secret message (secrecy outage probability). We derive a closed form expression of the secrecy outage probability and then we consider the problem of allocating the power among the space streams, in order to maximize the total rate of the secret message under a constraint on the secrecy outage probability.

IEEE Globecom Workshops (GC Wkshps)Dec 1, 20134 citations

Secrecy CPS Transmission Scheme for Slow Fading Independent Parallel Wiretap Channels with New SOP Constraint

Xia Wang, Pengcheng Mu, Weile Zhang +1 more

This paper concerns the problem of secrecy transmission on slow fading parallel wiretap channels, where a transmitter Alice wants to transmit messages to an intended receiver Bob with an illegitimate receiver Eve eavesdropping on these messages. The channels are modeled as independent Parallel Rayleigh fading channels, and the coding per sub-channel (CPS) scheme is used with distinct encoders for each sub-channel. Moreover, the channel state information (CSI)concerning Bob is assumed to be perfectly known, while only the probability density function (PDF) of the CSI concerning Eve is available since Eve is usually a passive receiver. We aim to maximize the sum of secrecy rates with the CPS scheme under the constraint of secrecy outage probability (SOP). To this end, we propose a new average SOP which is a weighted sum of all the SOP for each sub-channel, and a secrecy rate maximization (SRM) problem is formulated under the constraint of SOP. Since this SRM problem is not convex and difficult to solve, three suboptimal solutions are proposed which improves the secrecy rate step by step. Numerical results show that the new SOP constraint is beneficial to improve the secrecy rate compared to the conventional one.

IEEE International Conference on Communications workshopsMay 1, 20180 citations

Secrecy Transmission on Parallel Channels: Theoretical Limits and Performance of Practical Codes

Marco Baldi, Franco Chiaraluce, Nicola Laurenti +2 more

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that Alice perfectly knows the set of channels with respect to Bob, but she has only a statistical knowledge of the channels with respect to Eve. We derive bounds on the achievable outage secrecy rates, by considering coding either within each channel or across all parallel channels. Transmit power is adapted to the channel conditions, with a constraint on the average power over the whole transmission. We also focus on the maximum cumulative outage secrecy rate that can be achieved. Moreover, in order to assess the performance in a real life scenario, we consider the use of practical error correcting codes. We extend the definitions of security gap and equivocation rate, previously applied to the single additive white Gaussian noise channel, to Rayleigh distributed parallel channels, on the basis of the error rate targets and the outage probability. Bounds on these metrics are also derived, considering the statistics of the parallel channels. Numerical results are provided, that confirm the feasibility of the considered physical layer security techniques.

IEEE Transactions on Information Forensics and SecurityAug 18, 201437 citations

Secrecy via Sources and Channels 1

Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramch

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available – correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution and prove its optimality for the parallel channels and sources case when each sub-channel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper). This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated. I.

Mar 17, 201141 citations