The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Unconditionally secure key agreement and the intrinsic conditional information
Abstract
This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y, and Z, respectively, with joint distribution P/sub XYZ/. The secret-key rate S(X;Y/spl par/Z) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but authenticated channel such that Eve's information about this key is arbitrarily small. We define a new conditional mutual information measure, the intrinsic conditional mutual information between S and Y when given Z, denoted by I(X;Y/spl darr/Z), which is an upper bound on S(X;Y/spl par/Z). The special scenarios are analyzed where X, Y, and Z are generated by sending a binary random variable R, for example a signal broadcast by a satellite, over independent channels, or two scenarios in which Z is generated by sending X and Y over erasure channels. In the first two scenarios it can be shown that the secret-key rate is strictly positive if and only if I(X;Y/spl darr/Z) is strictly positive. For the third scenario, a new protocol is presented which allows secret-key agreement even when all the previously known protocols fail.
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 7×
“In [13] this pessimism has been relativized by pointing out that Shannon’s apparently innocent assumption that, except for the secret key, the opponent has access to precisely the same information as the legitimate receiver, is very restrictive and that indeed in many practical scenarios, especially if one considers t…”
MethodInfluentialWyner, 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
An Introduction to Probability Theory.
Fristedt, B., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,300
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
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-citationExperimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Common 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
An Introduction to Probability Theory and Its Applications
Freedman, D. A., & Feller, W. (1967) · Econometrica · doi:10.2307/1905668 · Cited by 1,244
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
A new outlook on Shannon's information measures
Yeung, R. W. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79902 · Cited by 221
Efficient Cryptographic Protocols Based on Noisy Channels
Crépeau, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_21 · Cited by 169
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
Self-citationInformation-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion
Maurer, U. M. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_15 · Cited by 94
Self-citationProtocols for Secret Key Agreement by Public Discussion Based on Common Information
Maurer, U. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_32 · Cited by 88
Self-citationBounds on secret key exchange using a random deal of cards
Fischer, M. J., & Wright, R. N. (1996) · Journal of Cryptology · doi:10.1007/bf00190803 · Cited by 59
Towards characterizing when information-theoretic secret key agreement is possible
Maurer, U. M., & Wolf, S. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034847 · Cited by 27
Self-citationSecret key sharing and secret key generation
Dijk, V. M. M. (1997) · TU/e Research Portal · doi:10.6100/ir501451 · Cited by 25
The intrinsic conditional mutual information and perfect secrecy
Maurer, U. M., & Wolf, S. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1997.613003 · Cited by 21
Self-citation
Cited by
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Guaranteeing Secrecy using Artificial Noise
Goel, S., & Negi, R. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.060848 · Cited by 1,917
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
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Metadata
- Authors
- Maurer, U. M., & Wolf, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1999-03
- Volume
- 45
- Issue
- 2
- Pages
- 499-514
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2110358873
- Cited by
- 274
- References
- 19
- FWCI
- 5.29
- 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.