The DOI matches its Crossref record.
Common randomness in information theory and cryptography. I. Secret sharing
Abstract
As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered. The concept of key-capacity is defined. Single-letter formulas of key-capacity are obtained for several models, and bounds to key-capacity are derived for other models.>
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
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
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
Nonlocal correlations as an information-theoretic resource
Barrett, J., Linden, N., Massar, S., Pironio, S., Popescu, S., & Roberts, D. (2005) · Physical Review A · doi:10.1103/physreva.71.022101 · Cited by 616
Monogamy of quantum entanglement and other correlations
Koashi, M., & Winter, A. (2004) · Physical Review A · doi:10.1103/physreva.69.022309 · Cited by 609
Mukherjee, A. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2466548 · Cited by 347
Metadata
- Authors
- Ahlswede, R., & Csiszar, I.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1993-07
- Volume
- 39
- Issue
- 4
- Pages
- 1121-1132
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2108777864
- Cited by
- 1,325
- References
- 0
- FWCI
- 4.94
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Common randomness in information theory and cryptography. I. Secret sharing. https://app.cochat.ai/papers/10.1109/18.243431
- The paper
- Ahlswede, R., & Csiszar, I. (1993). Common randomness in information theory and cryptography. I. Secret sharing. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.243431
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.
