Multiple Access Wiretap Channel Research Articles

Multiple Access Wiretap Channel With Partial Rate-Limited Feedback

Multiple Access Wiretap Channel With Partial Rate-Limited Feedback

Deep learning approach for physical-layer security in Gaussian multiple access wiretap channel

Deep learning approach for physical-layer security in Gaussian multiple access wiretap channel

Secure Transmission Over Multiple Access Wiretap Channel by Cross-Time Interference Injection

Due to the openness of wireless communication, information transmitted in the multiple access channel is vulnerable to eavesdropping by illegitimate users. Classic artificial noise-assisted schemes can improve security but are not suitable for power-constrained users. To address this problem, we propose a cross-time interference injection scheme in this paper, which improves security by introducing cross-time self-interference and inter-user interference, and does not require artificial noise. The proposed scheme exploits the properties of the Hadamard matrix and the wireless channels, so that the eavesdropping channel suffers from stronger interference than the legitimate channel. We analyze the security performance when both the legitimate receiver and the eavesdropper exploit the successive interference cancellation (SIC) scheme, including the secrecy sum rate, the secrecy capacity, and the secrecy outage probability. We further investigate the effect of the number of eavesdropper’s antennas, the number of legitimate users, and the number of time slots used by the scheme on the security performance, and obtain the corresponding relationship between these parameters when achieving a positive secrecy rate. Finally, simulation results corroborate our theoretical analysis.

Gaussian Multiuser Wiretap Channels in the Presence of a Jammer-Aided Eavesdropper.

This paper considers secure communication in the presence of an eavesdropper and a malicious jammer. The jammer is assumed to be oblivious of the communication signals emitted by the legitimate transmitter(s) but can employ any jamming strategy subject to a given power constraint and shares her jamming signal with the eavesdropper. Four such models are considered: (i) the Gaussian point-to-point wiretap channel; (ii) the Gaussian multiple-access wiretap channel; (iii) the Gaussian broadcast wiretap channel; and (iv) the Gaussian symmetric interference wiretap channel. The use of pre-shared randomness between the legitimate users is not allowed in our models. Inner and outer bounds are derived for these four models. For (i), the secrecy capacity is obtained. For (ii) and (iv) under a degraded setup, the optimal secrecy sum-rate is characterized. Finally, for (iii), ranges of model parameter values for which the inner and outer bounds coincide are identified.

Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel

It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).

Achievable Regions and Precoder Designs for the Multiple Access Wiretap Channels With Confidential and Open Messages

This paper investigates the secrecy achievable region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver (or Bob for brevity) but only the confidential messages need to be protected from the eavesdropper (Eve). We first consider a discrete memoryless (DM) MAC-WT channel where both Bob and Eve jointly decode their interested messages. By using random coding, we find an achievable rate region, within which perfect secrecy can be realized, i.e., all users can communicate with Bob with arbitrarily small probability of error, while the confidential information leaked to Eve tends to zero. Due to the high implementation complexity of joint decoding, we also consider the DM MAC-WT channel where Bob simply decodes messages independently while Eve still applies joint decoding. We then extend the results in the DM case to a Gaussian vector (GV) MAC-WT channel. Based on the information theoretic results, we further maximize the sum secrecy rate of the GV MAC-WT system by designing precoders for all users. Since the problems are non-convex, we provide iterative algorithms to obtain suboptimal solutions. Simulation results show that compared with existing schemes, secure communication can be greatly enhanced by the proposed algorithms, and in contrast to the works which only focus on the network secrecy performance, the system spectrum efficiency can be effectively improved since open messages can be simultaneously transmitted.

Self-Secure Capacity-Achieving Feedback Schemes of Gaussian Multiple-Access Wiretap Channels With Degraded Message Sets

Self-Secure Capacity-Achieving Feedback Schemes of Gaussian Multiple-Access Wiretap Channels With Degraded Message Sets

Self-Secure Capacity-Achieving Feedback Schemes of Gaussian Multiple-Access Wiretap Channels With Degraded Message Sets

It has been shown that the SK scheme, which was proposed by Schalkwijk and Kailath, is a self-secure capacity-achieving (SSCA) feedback scheme for the Gaussian wiretap channel, i.e., the SK scheme not only achieves the feedback capacity of the Gaussian channel, but also is secure by itself and achieves the feedback secrecy capacity of the Gaussian wiretap channel. For the multi-user wiretap channels, very recently, it has been shown that Ozarow’s capacity-achieving feedback scheme for the two-user Gaussian multiple-access channel (GMAC) is the SSCA feedback scheme for the two-user Gaussian multiple-access wiretap channel (GMAC-WT). In this paper, first, we propose a SSCA feedback scheme for the two-user GMAC-WT with degraded message sets (GMAC-WT-DMS). Next, we extend the above scheme to the two-user GMAC-WT-DMS with noncausal channel state information at the transmitters (NCSIT), and show that the extended scheme is also a SSCA feedback scheme. Finally, we derive outer bounds on the secrecy capacity regions of the two-user GMAC-WT-DMS with or without NCSIT, and numerical results show the rate gains by the feedback.

Secure Transmission in Multiple Access Wiretap Channel: Cooperative Jamming Without Sharing CSI

This paper investigates the secure transmission in multiple access wiretap channels, where multiple legitimate users transmit private information to an intended receiver in the presence of multiple eavesdroppers. In order to improve security, we propose a novel cooperative jamming scheme, in which users do not share channel state information (CSI) but the legitimate channels will not be degraded by the artificial noise. The basic idea is to make each user exploit its own CSI in two slots to design artificial noise, so that the intended receiver can eliminate all the artificial noise but the eavesdroppers cannot. In this process, the interference between users plays a key role to achieve security, because it guarantees that the artificial noise from different users helps each other. We consider the non-collusion and collusion of eavesdroppers and analyze the secrecy performance for both scenarios. We adopt the secrecy sum-rate as the main metric, and show that positive secrecy sum-rate can be achieved by using the proposed scheme. Especially, we observe that when eavesdroppers collude and their additive white Gaussian noise (AWGN) close to zero, the number of users must not be less than twice the number of eavesdroppers to ensure positive secrecy sum-rate. Finally, simulation results are provided to corroborate our theoretical findings.

Strong Secrecy of Arbitrarily Varying Multiple Access Channels

This paper investigates the strong secrecy capacity of the arbitrarily varying multiple access channel (AVMAC). First, Csiszár's almost independent coloring lemma is generalized to establish an achievable secrecy rate region of the AVMAC with an eavesdropper, which includes existing results on both the arbitrarily varying wiretap channel and the multiple access wiretap channel. We then determine the capacity for a special case named semi-noiseless wiretap channel. In addition, a multi-letter outer bound is also presented. Finally, the results of this paper are further explained via a binary example with a numerical inner bound.

Two-Multicast Channel With Confidential Messages

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El Gamal and the method of output statistics of random binning. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that derives an inner bound on the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.

Adding Common Randomness Can Remove the Secrecy Penalty in GDoF

In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past decades a significant amount of effort has been made by the researchers to understand the limits of secrecy constraints in communication networks. In this work, we focus on how to remove the secrecy penalty in communication networks, i.e., how to remove the GDoF penalty due to secrecy constraints. We begin with three basic settings: a two-user symmetric Gaussian interference channel with confidential messages, a symmetric Gaussian wiretap channel with a helper, and a two-user symmetric Gaussian multiple access wiretap channel. Interestingly, in this work we show that adding common randomness at the transmitters can totally remove the penalty in GDoF or GDoF region of the three settings considered here. The results reveal that adding common randomness at the transmitters is a powerful way to remove the secrecy penalty in communication networks in terms of GDoF performance. Common randomness can be generated offline before the real-time message communication. The role of the common randomness is to jam the information signal at the eavesdroppers, without causing too much interference at the legitimate receivers. To accomplish this role, a new method of Markov chain-based interference neutralization is proposed in the achievability schemes utilizing common randomness. From the practical point of view, we need to minimize the amount of common randomness used for removing the secrecy penalty in terms of GDoF performance. With this motivation, for most of the cases we characterize the minimal GDoF of common randomness to remove secrecy penalty, based on our derived converses and achievability.

Optimal rotation angle for finite constellation over additive white Gaussian noise multiple access wiretap channel

The achievable secrecy rate regions of various multi-user channels with Gaussian inputs are well-known in the literature. To gain more practical insights into the achievable rates, it is more useful to consider channels with inputs from finite constellations, such as M-ary quadrature amplitude modulation (M-QAM), M-ary phaseshift keying (MPSK), M-ary amplitude phase-shift keying (M-APSK) etc. The authors study the achievable secrecy rates with a constrained constellation input for a multiple access wiretap channel with an eavesdropper. They also show that if the constellation points are rotated relatively for the two users then the secrecy sum-rate can be improved. They perform Monte–Carlo simulations for computing these secrecy rates for classical modulation schemes including BPSK, quadrature phase-shift keying, M-QAM, M-PSK, M-PAM, and M-APSK. They also derived an approximate function, whose argument of supremum provides an approximately optimal rotation angle for obtaining a maximum secrecy sum-rate. they also show, via simulations, that rotation of constellation is helpful for some range of signal-to-noise ratio only, which is contrary to the results of multiple access channel without security constraint. Finally, they consider a more realistic scenario, where the channel from transmitters to receivers and eavesdroppers is time-varying. They consider the case of complex circularly symmetric Gaussian random channel gains and compute the optimal rotation angle, which will maximise the expected value of an upper bound of the secrecy sum-rate.

Enhancement of reliability and security in spatial diversity FSO-CDMA wiretap channel

Abstract Due to atmospheric turbulence, the reliability and security of free space optical (FSO) communication will be affected seriously. In this paper, we propose a novel scheme of quasisynchronous spatial diversity free-space optical code division multiple access (FSO-CDMA) wiretap channel based on gamma-gamma distribution. Considering multiple access interference, shot noise, thermal noise and background noise, performances of bit error rate (BER) and physical-layer security are analyzed theoretically. The physical-layer security of quasisynchronous spatial diversity FSO-CDMA wiretap channel is evaluated by secrecy capacity and interception probability. Closed-form expression of interception probability is obtained. In order to compare the performances between conventional spatial diversity FSO-CDMA and the proposed scheme, Optisystem simulation is carried out. The results indicate that quasisynchronous spatial diversity FSO-CDMA scheme can improve the reliability and physical-layer security simultaneously.

Achieving Positive Secrecy Rate in Wireless Multiple Access Wiretap Channels

In this paper, we study the secure transmission in multiple access wiretap channels when the instantaneous channel state information (CSI) of the wiretap channels is unknown by the legitimate users. We propose a two-phase jamming-assisted secure transmission scheme based on the randomness and independence of wireless channels. In this scheme, we appropriately design artificial noise in two transmission phases and make sure that the eavesdropper's channel is degraded by the artificial noise but the legitimate user's channel is free of the artificial noise. We analyze the capacity of the legitimate channel after using successive interference cancellation (SIC), and demonstrate that the eavesdropping capacity has an upper bound. Furthermore, we prove that a positive secrecy rate can be achieved and the achievable secrecy rate can be maximized by allocating appropriate power to the private information and the artificial noise.

On the secrecy rate region and outage probability of secondary wiretap multiple access channel over dissimilar Rayleigh/Nakagami fading

A secondary fading multiple access channel (S-FMAC) with two transmitters, having random available bandwidth taking values 0 or 1 and one coherent receiver knowing random and independent channel coefficients, has been studied before. In this paper, we investigate the wiretap version of S-FMAC as a secondary multiple access wiretap channel (S-MAC-WT) over similar Rayleigh/ Rayleigh and dissimilar Rayleigh/Nakagami fading, and having briefly reviewed the point to point version, we obtain closed-form expressions for the secrecy rate region and the corresponding outage probability. To validate the theoretical results, secrecy outage probability for sum-rate of S-FMAC-WT is numerically computed.

Secure Degrees of Freedom in Networks with User Misbehavior

We investigate the secure degrees of freedom (s.d.o.f.) of three new channel models: broadcast channel with combating helpers, interference channel with selfish users, and multiple access wiretap channel with deviating users. The goal of introducing these channel models is to investigate various malicious interactions that arise in networks, including active adversaries. That is in contrast with the common assumption in the literature that the users follow a certain protocol altruistically and transmit both message-carrying and cooperative jamming signals in an optimum manner. In the first model, over a classical broadcast channel with confidential messages (BCCM), there are two helpers, each associated with one of the receivers. In the second model, over a classical interference channel with confidential messages (ICCM), there is a helper and users are selfish. By casting each problem as an extensive-form game and applying recursive real interference alignment, we show that, for the first model, the combating intentions of the helpers are neutralized and the full s.d.o.f. is retained; for the second model, selfishness precludes secure communication and no s.d.o.f. is achieved. In the third model, we consider the multiple access wiretap channel (MAC-WTC), where multiple legitimate users wish to have secure communication with a legitimate receiver in the presence of an eavesdropper. We consider the case when a subset of users deviate from the optimum protocol that attains the exact s.d.o.f. of this channel. We consider two kinds of deviation: when some of the users stop transmitting cooperative jamming signals, and when a user starts sending intentional jamming signals. For the first scenario, we investigate possible responses of the remaining users to counteract such deviation. For the second scenario, we use an extensive-form game formulation for the interactions of the deviating and well-behaving users. We prove that a deviating user can drive the s.d.o.f. to zero; however, the remaining users can exploit its intentional jamming signals as cooperative jamming signals against the eavesdropper and achieve an optimum s.d.o.f.

Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel under different wiretapping scenarios is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-size subset of the channel uses, in which it obtains noise-free observations of one of the codewords: a deterministic function, e.g., superposition, of the two codewords or each of the two codewords. A fourth wiretapping scenario is considered, in which the wiretapper, in each position it chooses, decides to observe either one of the codewords or both codewords, with an overall budget on the number of its noiselessly observed symbols. These, thus, extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a variety of attack models for the wiretapper. Next, the proposed multiple access wiretap channel II models are further generalized to the case when the wiretapper observes the outputs of a discrete memoryless channel, instead of erasures, outside the subset of noiseless observations. Achievable strong secrecy rate regions for all the proposed models are derived. Achievability is established by solving dual multi-terminal secret key agreement problems in the source model and converting the solution to the original channel models using probability distribution approximation arguments. The derived achievable rate regions quantify the secrecy cost due to the additional capabilities of the wiretapper with respect to the previous multiple access wiretap models.

On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel With a Helper: Achievable Schemes and Upper Bounds

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2 secure degrees of freedom (s.d.o.f.) for the G-MAC-WT and the G-WT-H, respectively. While the s.d.o.f. were obtained by real interference alignment, our approach uses signal-scale alignment. We show achievable schemes which are independent of the rationality of the channel gains. Moreover, our results can differentiate between channel strengths, in particular, between both users, and will establish secrecy rates dependent on this difference. We can show that the resulting achievable secrecy rates tend to the s.d.o.f. for vanishing channel gain differences. Moreover, we extend previous and develop new techniques to prove generalized s.d.o.f. bounds for varying channel strengths and show that our achievable schemes reach the bounds for certain channel gain parameters. We believe that our analysis is the next step toward a constant-gap analysis of the G-MAC-WT and the G-WT-H.

10 Gb/s two-dimensional free-space optical code division multiple access wiretap channel with spatial diversity

We experimentally demonstrate a 10 Gb/s free-space optical wiretap channel based on a spatial-diversity scheme and optical code division multiple access. In weak and middle turbulence cases, the bit error rate of a legitimate user can be decreased, and physical layer security can be simultaneously enhanced.