The DOI matches its Crossref record.
Broadcast channels with confidential messages
Abstract
Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver1rateR_{1}and common messages to both receivers at rateR_{o}, while keeping receiver2as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples(R_{1},R_{e},R_{o})whereR_{e}is the equivocation rate. Based on this channel coding result, the related source-channel matching problem is also settled. These results generalize those of Wyner on the wiretap channel and of Körner-Marton on the broadcast Channel.
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
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
From Bell’s Theorem to Secure Quantum Key Distribution
Acín, A., Gisin, N., & Masanes, L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.120405 · Cited by 709
The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445
“The corresponding theorem for classical “wire-tap”channels was proven in [6].”
BackgroundUniversally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Orlitsky, A., & Roche, J. R. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915643 · Cited by 307
Security of two quantum cryptography protocols using the same four qubit states
Branciard, C., Gisin, N., Kraus, B., & Scarani, V. (2005) · Physical Review A · doi:10.1103/physreva.72.032301 · Cited by 146
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Experimenter’s freedom in Bell’s theorem and quantum cryptography
Kofler, J., Paterek, T., & Brukner, Č. (2006) · Physical Review A · doi:10.1103/physreva.73.022104 · Cited by 38
Secure MIMO D2D communication based on a lightweight and robust PLS cipher scheme
Noura, H. N., Melki, R., Kanj, R., & Chehab, A. (2021) · Wireless Networks · doi:10.1007/s11276-020-02468-z · Cited by 6
Metadata
- Authors
- Csiszar, I., & Korner, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1978-05
- Volume
- 24
- Issue
- 3
- Pages
- 339-348
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2144007657
- Cited by
- 3,332
- References
- 0
- FWCI
- 5.85
- 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.
