Secrecy Capacity of Independent Parallel Channels

Zang, Li; Yates, Roy D.; Trappe, Wade

doi:10.1007/978-1-4419-1385-2_1

Cited by 124 publications

(162 citation statements)

References 14 publications

Supporting

Mentioning

155

Contrasting

Order By: Relevance

“…Our results generalize the secrecy capacity results that have been recently obtained in [12], [13] and [14] (full CSI case). We have also studied the outage performance of the fading BCC.…”

Section: Discussionsupporting

confidence: 89%

“…Compared to the fading wire-tap channel studied in [12] (the conference version of this paper), [13] and [14] (full CSI case), the fading BCC we study in this paper assumes that the source node has a common message for both receivers in addition to the confidential message for receiver 1. Hence the fading BCC includes the fading wire-tap channel as a special case.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secure Communication Over Fading Channels

Liang

Poor

Shamai

2008

IEEE Trans. Inform. Theory

794

View full text Add to dashboard Cite

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derive that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

show abstract

“…Our results generalize the secrecy capacity results that have been recently obtained in [12], [13] and [14] (full CSI case). We have also studied the outage performance of the fading BCC.…”

Section: Discussionsupporting

confidence: 89%

Section: Introductionmentioning

confidence: 99%

Secure Communication Over Fading Channels

Liang

Poor

Shamai

2008

IEEE Trans. Inform. Theory

794

View full text Add to dashboard Cite

show abstract

“…We also note that, despite this, for all the channels where secrecy capacity has been identified, e.g., the scalar Gaussian channel [17], the parallel Gaussian channel which also models the fading Gaussian wiretap channel where all the parties know the instantaneous realizations of all the fading channel gains [18,19], and the MIMO Gaussian channel [20][21][22], this selection has been shown to be optimal. However, there are channels, such as the fading Gaussian wiretap channel without channel state information of the wiretapper at the transmitter [23], it was shown that choosing V = X is strictly suboptimal.…”

Section: Information Theoretic Secrecymentioning

confidence: 99%

Cooperative Secrecy in Wireless Communications

Ulukuş

Ekrem

2009

Securing Wireless Communications at the Physical Layer

View full text Add to dashboard Cite

The broadcast nature of wireless communications leads to two concepts: cooperation and secrecy. The basis for both cooperation and the potential lack of secrecy is the over-heard information at the unintended parties, which wireless communication channel provides for free. It is well-established that users can help increase each others' rates by intelligently using their over-heard information. It is also well-accepted that the leakage of information through the over-heard signals may cause loss of confidentiality and secrecy. Cooperation and secrecy have been studied individually over the past three decades following the seminal papers of van der Meulen [1] who introduced the relay channel, which is the simplest model for cooperative communications and Wyner [2] who introduced the wire-tap channel, which is the simplest model to study secrecy in communications. It is interesting to note that, both of these are simple three-node networks, where in the former, the sole purpose of the third node (relay) is to increase the achievable rate of the single-user channel between the transmitter and the receiver by transmitting signals based on its over-heard information, while in the latter, the third node (eavesdropper) is a passive entity which uses its over-heard information to extract as much information as possible about the messages transmitted in the single-user communication channel between the transmitter and the receiver. In this chapter, we will summarize the mostly separate literatures on cooperation and secrecy.More recently, there has been a tremendous amount of interest and some initial work on the interactions of cooperation and secrecy. The recent literature on the S. Ulukus ( )

show abstract

“…In [9][10][11][12], resource allocation schemes of OFDM secrecy systems were studied in the case of single-user system, two-user system, and multiuser system, respectively. Specifically, joint power and subcarrier allocation were investigated for the network with the coexistence of secure users and normal users [11].…”

Section: Introductionmentioning

confidence: 99%

Fair Resource Allocation with QoS Guarantee in Secure Multiuser TDMA Networks

Bai

Wang

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

We investigate a secure multiuser time division multiple access (TDMA) system with statistical delay quality of service (QoS) guarantee in terms of secure effective capacity. An optimal resource allocation policy is proposed to minimize the -fair cost function of the average user power under the individual QoS constraint, which also balances the energy efficiency and fairness among the users. First, convex optimization problems associated with the resource allocation policy are formulated. Then, a subgradient iteration algorithm based on the Lagrangian duality theory and the dual decomposition theory is employed to approach the global optimal solutions. Furthermore, considering the practical channel conditions, we develop a stochastic subgradient iteration algorithm which is capable of dynamically learning the intended wireless channels and acquiring the global optimal solution. It is shown that the proposed optimal resource allocation policy depends on the delay QoS requirement and the channel conditions. The optimal policy can save more power and achieve the balance of the energy efficiency and the fairness compared with the other resource allocation policies.

show abstract

Secrecy Capacity of Independent Parallel Channels

Cited by 124 publications

References 14 publications

Secure Communication Over Fading Channels

Secure Communication Over Fading Channels

Cooperative Secrecy in Wireless Communications

Fair Resource Allocation with QoS Guarantee in Secure Multiuser TDMA Networks

Contact Info

Product

Resources

About