The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Secrecy Capacity of Wireless Channels
Abstract
We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel, we define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
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 1×
“The theoretical basis for this information-theoretic approach, which builds on Shannon’s notion of perfect secrecy [5], was laid by Wyner [6] and later by Csiszár and Körner [7], who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of d…”
BackgroundWyner, 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
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
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
Secure space-time communication
Hero, A. O. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820010 · Cited by 294
Capacity Achieving Codes for the Wire Tap Channel with Applications to Quantum Key DistributionPreprint
Thangaraj, A., Dihidar, S., Calderbank, A. R., et al. (2004) · arXiv (Cornell University) · Cited by 16
Research works printed but not linked: 2
- 10.1109/ITW.2006.1633793 · doi:10.1109/itw.2006.1633793
- leung-yan-cheeng, 1978, The gaussian wiretap channel, IEEE Trans on Inform Theory, 24, 451456
Cited by
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
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
Self-citationPrinciples 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 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
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
Metadata
- Authors
- Barros, J., & D. Rodrigues, M. R.
- Venue
- 2006 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2006-07
- Pages
- 356-360
- OpenAlex
- W2102654676
- Cited by
- 824
- References
- 10
- FWCI
- 40.87
- Type
- conference paper
- 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.