The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Secure space-time communication
Abstract
Network security is important for information protection in open, secure, or covert communications. One such requirement is to achieve high-rate communications between clients, e.g., terminals or sensors, in the network while hiding information about the transmitted symbols, signal activity, or other sensitive data from an unintended receiver, e.g., an eavesdropper. For wireless links, the single-user capacity advantages of deployment of multiple antennas at the transmitter is well known. One of the principal conclusions of this paper is that proper exploitation of space-time diversity at the transmitter can also enhance information security and information-hiding capabilities. In particular, we show that significant gains are achievable when the transmitter and the client receiver are both informed about their channel while the transmitter and eavesdropper receiver are uniformed about their channel. More generally, we compare capacity limits for both informed and uninformed transmitter and informed receiver scenarios subject to low probability of intercept (LPI) and low probability of detection (LPD) constraints. For several general cases, we can characterize the LPI- and LPD-optimal transmitted source distributions and compare them to the standard optimal source distribution satisfying a power constraint. We assume the standard quasi-static flat Rayleigh-fading channel model for the transmitter-receiver pairs. This paper is a step toward answering the fundamental question: what are the qualitative and quantitative differences between the information-carrying capabilities of open space-time channels versus secure space-time channels?
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
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×
“This LPI condition is equivalent to the perfect secrecy condition in cryptography [30].”
BackgroundInfluentialWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
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
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Large Deviations Techniques and Applications
Dembo, A., & Zeitouni, O. (1998) · Springer eBooks · doi:10.1007/978-1-4612-5320-4 · Cited by 3,019
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
How much training is needed in multiple-antenna wireless links?
Hassibi, B., & Hochwald, B. M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809594 · Cited by 2,312
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
Marzetta, T. L., & Hochwald, B. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746779 · Cited by 1,348
Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
Hochwald, B. M., & Marzetta, T. L. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825818 · Cited by 1,027
Zheng, L., & Tse, D. N. C. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.978730 · Cited by 986
New criteria for blind deconvolution of nonminimum phase systems (channels)
Shalvi, O., & Weinstein, E. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.52478 · Cited by 863
Systematic design of unitary space-time constellations
Hochwald, B. M., Marzetta, T. L., Richardson, T. J., et al. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.868472 · Cited by 707
Information-theoretic analysis of information hiding
Moulin, P., & O'Sullivan, J. A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.808134 · Cited by 673
Unconventional cryptographic keying variable management
Hershey, J. E., Hassan, A. A., & Yarlagadda, R. (1995) · IEEE Transactions on Communications · doi:10.1109/26.385951 · Cited by 231
Hassibi, B., & Marzetta, T. L. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003835 · Cited by 221
Cryptographic Key Agreement for Mobile Radio
Hassan, A. A., Stark, W. E., Hershey, J. E., et al. (1996) · Digital Signal Processing · doi:10.1006/dspr.1996.0023 · Cited by 159
Secure information transmission for mobile radio
Koorapaty, H., Hassan, A. A., & Chennakeshu, S. (2000) · IEEE Communications Letters · doi:10.1109/4234.824754 · Cited by 159
Digital watermarking: from concepts to real-time video applications
Busch, C., Funk, W., & Wolthusen, S. D. B. (1999) · IEEE Computer Graphics and Applications · doi:10.1109/38.736466 · Cited by 111
Modulation and demodulation for probabilistic coding
Wozencraft, J. M., & Kennedy, R. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053909 · Cited by 95
Sequential Decoding - The Computation Problem*
Savage, J. E. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb04210.x · Cited by 53
Security issues in networks with Internet access
Landwehr, C. E., & Goldschlag, D. M. (1997) · Proceedings of the IEEE · doi:10.1109/5.650183 · Cited by 45
Probabilistic construction of large constraint length trellis codes for sequential decoding
Wang, F.-Q., & Costello, D. J. (1995) · IEEE Transactions on Communications · doi:10.1109/26.412718 · Cited by 23
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
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
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
- Hero, A. O.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-12
- Volume
- 49
- Issue
- 12
- Pages
- 3235-3249
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2145577744
- Cited by
- 294
- References
- 28
- FWCI
- 4.69
- 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.