We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable secure rates (lower bounds on the perfect secrecy capacity), both for the discrete memoryless and Gaussian channels. We also compare the proposed rates to the non...

This paper deals with the secrecy guaranteed at the physical layer, namely physical layer security (PLS). The aim is to evaluate the achievable rate on the power delivery infrastructure, or power line communication (PLC) networks, under secrecy constraints. The focus is on the multiple-input, multipleoutput and multiple eavesdropper (MIMO-ME) wiretap communication channel. The system consists o...

in this paper, we consider a cooperative cognitive radio network in which there is an ofdm primary link and multiple single carrier secondary links.the primary link is required to maintain its secrecy rate above a predefined threshold. if the secrecy rate requirement is not satisfied, the secondary system help primary link to maintain its secrecy rate requirement. in doing so, the secondary trans...

—The achievable secrecy throughput of the distributed cognitive radio wireless networks (DCRWNs) is investigated in this paper. The related works on the secrecy performance mainly focus on the average value depending on nodes spatial distribution. However, these results neglect the effect of nodes location on the performance discrepancies. To break this bottleneck, a new framework is developed...

We investigate individual secrecy performance in a K-user quasi-static Rayleigh fading homogeneous multiple access wiretap channel (MAC-WT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closed-form expressions with respect to secrecy outage probability and effect...

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted rel...

In this paper, we consider a transmit power allocation problem for secure transmission in multi-hop decode-and-forward (DF) full-duplex relay (FDR) networks, where multiple FDRs are located at each hop and perform cooperative beamforming to null out the signal at multiple eavesdroppers. For a perfect self-interference cancellation (PSIC) case, where the self-interference signal at each FDR is c...

Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full...

This paper considers a Gaussian two-user multiple-input multiple-output (MIMO) multiple access channel (MAC) with cooperating encoders. After defining a form of cooperation strategy, we derive achievable rate bounds by applying the results obtained by Willems for the MAC with generalised feedback. Then, we characterise an achievable rate region and also provide a lower bound for this region, wh...

We consider a communication system where a relay helps transmission of messages from a sender to a receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In this paper we study a relay channel with confidential messages(RCC), where a sender attempts to transmit common information to both a receiver and a relay and al...