The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
Open accessAbstract
Suppose that Alice wishes to send messages to Bob through a communication channel$C_{1}$, but her transmissions also reach an eavesdropper Eve through another channel$C_{2}$. This is the wiretap channel model introduced by Wyner in 1975. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of the mutual information between the message and Eve's observations. Wyner showed that the situation is characterized by a single constant${\cal C}_{s}$, called the secrecy capacity, which has the following meaning: for all$\varepsilon \!\! > \!\! 0$, there exist coding schemes of rate$R\! \geqslant {\cal C}_{s} \! \! - \! \varepsilon$that asymptotically achieve the reliability and security objectives. However, his proof of this result is based upon a random-coding argument. To date, despite considerable research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel$C_{2}$is an erasure channel, or a combinatorial variation thereof.
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
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Arikan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,476
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
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
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
A performance comparison of polar codes and Reed-Muller codes
Arkan, E. (2008) · IEEE Communications Letters · doi:10.1109/lcomm.2008.080017 · Cited by 491
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
Nested Polar Codes for Wiretap and Relay Channels
Andersson, M., Rathi, V., Thobaben, R., Kliewer, J., & Skoglund, M. (2010) · IEEE Communications Letters · doi:10.1109/lcomm.2010.08.100875 · Cited by 174
The Strong Secret Key Rate of Discrete Random Triples
Maurer, U. M. (1994) · Springer eBooks · doi:10.1007/978-1-4615-2694-0_27 · Cited by 134
Secrecy-achieving polar-coding
Hof, E., & Shamai, S. S. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/cig.2010.5592878 · Cited by 89
Strong secrecy for erasure wiretap channels
Suresh, A. T., Subramanian, A., Thangaraj, A., et al. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/cig.2010.5592770 · Cited by 57
Polar coding for secure transmission and key agreement
Koyluoglu, O. O., & Gamal, H. E. (2010) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc.2010.5671797 · Cited by 54
Invertible extractors and wiretap protocols
Cheraghchi, M., Didier, F., & Shokrollahi, A. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205583 · Cited by 12
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
Tal, I., & Vardy, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2272694 · Cited by 853
Self-citationA 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
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
Metadata
- Authors
- Mahdavifar, H., & Vardy, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-10
- Volume
- 57
- Issue
- 10
- Pages
- 6428-6443
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2211831180
- Cited by
- 376
- References
- 18
- FWCI
- 16.93
- 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.