The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Wireless Information-Theoretic Security
Abstract
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal—even in the presence of imperfect channel state information.
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
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 [1], was laid by Wyner [2] and later by Csiszár and Körner [3], who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of d…”
BackgroundQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
Cited by
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
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
Optimal Relay Selection for Physical-Layer Security in Cooperative Wireless Networks
Zou, Y., Wang, X., & Shen, W. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.131011 · Cited by 513
A Survey on Multiple-Antenna Techniques for Physical Layer Security
Chen, X., Ng, D. W. K., Gerstacker, W. H., & Chen, H.-H. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2633387 · Cited by 474
Robust Beamforming for Security in MIMO Wiretap Channels With Imperfect CSI
Mukherjee, A., & Swindlehurst, A. L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2078810 · Cited by 454
Metadata
- Authors
- Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-06
- Volume
- 54
- Issue
- 6
- Pages
- 2515-2534
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2156214717
- Cited by
- 1,847
- References
- 4
- FWCI
- 55.88
- 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.
