The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming
Open accessAbstract
The general Gaussian multiple-access wiretap channel (GGMAC-WT) and the Gaussian two-way wiretap channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who receives their signals through another GMAC. In the GTW-WT, two users communicate with each other over a common Gaussian channel, with an eavesdropper listening through a GMAC. A secrecy measure that is suitable for this multiterminal environment is defined, and achievable secrecy rate regions are found for both channels. For both cases, the power allocations maximizing the achievable secrecy sum rate are determined. It is seen that the optimum policy may prevent some terminals from transmission in order to preserve the secrecy of the system. Inspired by this construct, a new scheme cooperative jamming is proposed, where users who are prevented from transmitting according to the secrecy sum rate maximizing power allocation policy ldquojamrdquo the eavesdropper, thereby helping the remaining users. This scheme is shown to increase the achievable secrecy sum rate. Overall, our results show that in multiple-access scenarios, users can help each other to collectively achieve positive secrecy rates. In other words, cooperation among users can be invaluable for achieving secrecy for the system.
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×
“A rigorous analysis of information theoretic secrecy was first given by Shannon in [9].”
Wyner, 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
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
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
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
Carleial, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055812 · Cited by 694
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
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
Applications of LDPC Codes to the Wiretap Channel
Thangaraj, A., Dihidar, S., Calderbank, A. R., McLaughlin, S. W., & Merolla, J.-M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901143 · Cited by 455
Liao, H. H.-J. (1972) · Cited by 391
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
Self-citationMultiple user information theory
El Gamal, A., & Cover, T. M. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11897 · Cited by 186
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
Coding for relay channels with confidential messages
Oohama, Y. (2002) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2001.955145 · Cited by 144
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
Achievable Rates for Two-Way Wire-Tap Channels
Tekin, E., & Yener, A. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557345 · Cited by 22
Self-citationWireless Information-Theoretic Security - Part I: Theoretical AspectsPreprint
Bloch, M. R., Barros, J., Rodrigues, M. R. D., et al. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0611120 · Cited by 22
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
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
A survey of physical layer security techniques for 5g wireless networks and challenges ahead
Wu, Y., Khisti, A., Xiao, C., Caire, G., Wong, K.-K., & Gao, X. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2825560 · Cited by 816
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
Metadata
- Authors
- Tekin, E., & Yener, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-06
- Volume
- 54
- Issue
- 6
- Pages
- 2735-2751
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2129457795
- Cited by
- 841
- References
- 29
- FWCI
- 50.80
- 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.