The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Cooperation With an Untrusted Relay: A Secrecy Perspective
Open accessAbstract
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show, by means of the achievable secrecy rate based on compress-and-forward, that by asking the untrusted relay node to relay information, we can achieve a higher secrecy rate than just treating the relay as an eavesdropper. For a special class of the second model, where the relay is not interfering itself, we derive an upper bound for the secrecy rate using an argument whose net effect is to separate the eavesdropper from the relay. The merit of the new upper bound is demonstrated on two channels that belong to this special class. The Gaussian case of the second model mentioned above benefits from this approach in that the new upper bound improves the previously known bounds. For the Cover-Kim deterministic relay channel, the new upper bound finds the secrecy capacity when the source-destination link is not worse than the source-relay link, by matching with achievable rate we present.
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
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 4×
“In his work, Shannon assumed that the eavesdropper has perfect access to the signal transmitted from the source to the destination and determined that the rate of key must equal to the rate of data to ensure “perfect secrecy”, i.e., in order for the data not to be leaked to the eavesdropper even if the eavesdropper ha…”
BackgroundInfluentialWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
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
Leung-Yan-Cheong, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055917 · Cited by 2,004
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
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
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-citationThe secrecy capacity of the MIMO wiretap channel
Oggier, F., & Hassibi, B. (2008) · 2008 IEEE International Symposium on Information Theory · doi:10.1109/isit.2008.4595041 · Cited by 310
Multiple-Access Channels With Confidential Messages
Liang, Y., & Poor, H. V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915978 · Cited by 303
Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages
Liu, R., Liu, T., Poor, H. V., & Shamai, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054593 · Cited by 190
Coding for relay channels with confidential messages
Oohama, Y. (2002) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2001.955145 · Cited by 144
Capacity of a Class of Deterministic Relay Channels
Kim, Y.-H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.915921 · Cited by 134
On the secrecy of multiple access wiretap channel
Ekrem, E., & Ulukuş, Ş. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797670 · Cited by 100
Two-Hop Secure Communication Using an Untrusted Relay
He, X., & Yener, A. (2009) · EURASIP Journal on Wireless Communications and Networking · doi:10.1155/2009/305146 · Cited by 88
Self-citationProviding Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian ChannelsPreprint
He, X., & Yener, A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0907.5388 · Cited by 69
Self-citationRelay Channels with Confidential MessagesPreprint
Oohama, Y. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0611125 · Cited by 63
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-citationProviding secrecy with lattice codes
He, X., & Yener, A. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797696 · Cited by 40
Self-citationOn the role of feedback in two-way secure communication
He, X., & Yener, A. (2008) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2008.5074582 · Cited by 27
Self-citation
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
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
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
A Survey on Millimeter-Wave Beamforming Enabled UAV Communications and Networking
Xiao, Z., Zhu, L., Liu, Y., Yi, P., Zhang, R., Xia, X.-G., & Schober, R. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3124512 · Cited by 420
Wireless physical layer security
Poor, H. V., & Schaefer, R. F. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618130114 · Cited by 335
Metadata
- Authors
- He, X., & Yener, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-08
- Volume
- 56
- Issue
- 8
- Pages
- 3807-3827
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2097480027
- Cited by
- 353
- References
- 21
- FWCI
- 18.69
- 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.