The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
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
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
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
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
Self-citationA Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
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
Self-citationCommon 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
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Secret-Key Reconciliation by Public Discussion
Brassard, G., & Salvail, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_35 · Cited by 781
(2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7 · Cited by 620
Unconditionally secure key agreement and the intrinsic conditional information
Maurer, U. M., & Wolf, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748999 · Cited by 274
Self-citationEntropy measures and unconditional security in cryptography
Cachin, C. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-001806220 · Cited by 246
Linking information reconciliation and privacy amplification
Cachin, C., & Maurer, U. M. (1997) · Journal of Cryptology · doi:10.1007/s001459900023 · Cited by 144
Self-citationThe 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
Self-citationConstruction of extractors using pseudo-random generators (extended abstract)
Trevisan, L. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301289 · Cited by 78
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
Gisin, N., & Wolf, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_30 · Cited by 50
Self-citationLinking Classical and Quantum Key Agreement: Is There "Bound Information"?Preprint
Gisin, N., & Wolf, S. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0005042 · Cited by 22
Self-citationExtracting all the Randomness from a Weakly Random Source
Vadhan, S. (1998) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 11
Cited by
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
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
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
The Physics of Quantum Information
(2000) · doi:10.1007/978-3-662-04209-0 · Cited by 1,086
Metadata
- Authors
- Maurer, U., & Wolf, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 351-368
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1875021344
- Cited by
- 483
- References
- 19
- FWCI
- 2.82
- Type
- conference paper
- 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.