The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
The Gaussian Multiple Access Wire-Tap Channel
Open accessAbstract
We consider the Gaussian multiple access wire-tap channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define suitable security measures for this multiaccess environment. Using codebooks generated randomly according to a Gaussian distribution, achievable secrecy rate regions are identified using superposition coding and time-division multiple access (TDMA) coding schemes. An upper bound for the secrecy sum-rate is derived, and our coding schemes are shown to achieve the sum capacity. Numerical results are presented showing the new rate region and comparing it with the capacity region of the Gaussian multiple-access channel (GMAC) with no secrecy constraints, which quantifies the price paid for secrecy.
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
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×
“INTRODUCTION Shannon, in [3], analyzed secrecy systems in communication s and showed that, to achieve perfect secrecy of communications, the conditional probab ility of the cryptogram given a message must be independent of the actual transmitted message.”
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
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
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
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
Self-citationSecrecy 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
Carleial, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055812 · Cited by 694
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
Secrecy Capacity of Independent Parallel Channels
Li, Z., Yates, R., & Trappe, W. (2009) · Securing Wireless Communications at the Physical Layer · doi:10.1007/978-1-4419-1385-2_1 · Cited by 169
Maurer, U., & Wolf, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809563 · Cited by 159
Secret-key agreement over unauthenticated public channels-part III: privacy amplification
Maurer, U., & Wolf, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809559 · Cited by 158
On the Secrecy Capacity of Fading Channels
Gopala, P. K., Lai, L., & Gamal, H. E. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557403 · Cited by 101
On Secure Signaling for the Gaussian Multiple Access Wire-tap Channel
Tekin, E., Serbetli, S., & Yener, A. (2006) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2005.1600069 · Cited by 56
Self-citationA note on Wyner's wiretap channel (Corresp.)
Carleial, A. B., & Hellman, M. E. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055721 · Cited by 54
The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
Tekin, E., & Yener, A. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261988 · Cited by 52
Self-citationOn secret sharing communication systems with two or three channels
Yamamoto, H. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057177 · Cited by 46
A coding theorem for secret sharing communication systems with two Gaussian wiretap channels
Yamamoto, H. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79919 · Cited by 43
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
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 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
Self-citationThe 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
Metadata
- Authors
- Tekin, E., & Yener, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-12
- Volume
- 54
- Issue
- 12
- Pages
- 5747-5755
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2115613211
- Cited by
- 317
- References
- 22
- FWCI
- 20.92
- Type
- journal article
- Language
- en
- Open access
- green
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.