The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Secure Communication Over Fading Channels
Abstract
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, which gives 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 derived 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
Capacity of fading channels with channel side information
Goldsmith, A. J., & Varaiya, P. P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641562 · Cited by 2,018
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Leung-Yan-Cheong, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055917 · Cited by 2,004
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
On the Secrecy Capacity of Fading Channels
Gopala, P. K., Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928990 · Cited by 1,261
Cited by
Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond
Liu, F., Cui, Y., Masouros, C., Xu, J., Han, T. X., Eldar, Y. C., & Buzzi, S. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3156632 · Cited by 3,857
Guaranteeing Secrecy using Artificial Noise
Goel, S., & Negi, R. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.060848 · Cited by 1,917
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
Mukherjee, A., Fakoorian, S. A. A., Huang, J., & Swindlehurst, A. L. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012314.00178 · Cited by 1,483
Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel
Khisti, A., & Wornell, G. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048445 · Cited by 1,350
On the Secrecy Capacity of Fading Channels
Gopala, P. K., Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928990 · Cited by 1,261
Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel
Khisti, A., & Wornell, G. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068852 · Cited by 975
The Secrecy Capacity of the MIMO Wiretap Channel
Oggier, F., & Hassibi, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158487 · Cited by 887
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921680 · Cited by 841
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Self-citationSecuring UAV Communications via Joint Trajectory and Power Control
Zhang, G., Wu, Q., Cui, M., & Zhang, R. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2892461 · Cited by 615
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
Self-citationOn Cooperative Relaying Schemes for Wireless Physical Layer Security
Li, J., Petropulu, A. P., & Weber, S. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2159598 · Cited by 414
Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers
Zheng, G., Krikidis, I., Li, J., Petropulu, A. P., & Ottersten, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2269049 · Cited by 384
Wireless physical layer security
Poor, H. V., & Schaefer, R. F. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618130114 · Cited by 335
Self-citationThe Gaussian Multiple Access Wire-Tap Channel
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006422 · Cited by 317
The secrecy capacity of the MIMO wiretap channel
Oggier, F., & Hassibi, B. (2008) · 2008 IEEE International Symposium on Information Theory · doi:10.1109/isit.2008.4595041 · Cited by 310
Physical Layer Network Security in the Full-Duplex Relay System
Chen, G., Gong, Y., Xiao, P., & Chambers, J. A. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2390136 · Cited by 288
Secure Broadcasting Over Fading Channels
Khisti, A., Tchamkerten, A., & Wornell, G. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921861 · Cited by 275
A Survey of Optimization Approaches for Wireless Physical Layer Security
Wang, D., Bai, B., Zhao, W., & Han, Z. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2883144 · Cited by 263
Wireless Communication and Security Issues for Cyber–Physical Systems and the Internet-of-Things
Burg, A., Chattopadhyay, A., & Lam, K.-Y. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2780172 · Cited by 257
What Physical Layer Security Can Do for 6G Security
Mitev, M., Chorti, A., Poor, H. V., & Fettweis, G. P. (2023) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2023.3245071 · Cited by 184
Self-citationEnergy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Metadata
- Authors
- Liang, Y., Poor, H. V., & Shamai, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-06
- Volume
- 54
- Issue
- 6
- Pages
- 2470-2492
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2159687282
- Cited by
- 937
- References
- 38
- FWCI
- 66.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.