The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
On the Secrecy Capacity of Fading Channels
Abstract
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 3×
“However, it was later shown by Wyner in [2] that this negative result was a consequence of the over-restrictive model used in [1].”
BackgroundResultWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
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
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
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
Secure Communication Over Fading Channels
Liang, Y., Poor, H. V., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921678 · Cited by 937
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921680 · Cited by 841
Secrecy Capacity of Wireless Channels
Barros, J., & D. Rodrigues, M. R. (2006) · 2006 IEEE International Symposium on Information Theory · doi:10.1109/isit.2006.261613 · Cited by 824
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
Self-citationOptimum power control over fading channels
Caire, G., Taricco, G., & Biglieri, E. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771147 · Cited by 755
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Maurer, U., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_24 · Cited by 483
The 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
Multiple-Access Channels With Confidential Messages
Liang, Y., & Poor, H. V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915978 · Cited by 303
Secrecy capacity of SIMO and slow fading channels
Parada, P., & Blahut, R. (2005) · Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. · doi:10.1109/isit.2005.1523727 · Cited by 277
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
The Wiretap Channel With Feedback: Encryption Over the Channel
Lai, L., El Gamal, H., & Poor, H. V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929914 · Cited by 167
Self-citationCoding for relay channels with confidential messages
Oohama, Y. (2002) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2001.955145 · Cited by 144
Cited by
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
Improving Wireless Physical Layer Security via Cooperating Relays
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038412 · Cited by 1,366
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
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
Secure Communication Over Fading Channels
Liang, Y., Poor, H. V., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921678 · Cited by 937
Metadata
- Authors
- Gopala, P. K., Lai, L., & El Gamal, H.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-10
- Volume
- 54
- Issue
- 10
- Pages
- 4687-4698
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2080693943
- Cited by
- 1,261
- References
- 20
- FWCI
- 57.68
- 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.