Towards characterizing when information-theoretic secret key agreement is possible (1996) [6 citations — 5 self]
|
Abstract:
Abstract. This paper is concerned with information-theoretically secure secret key agreement in the general scenario where three parties, Alice, Bob, and Eve, know random variables X, Y, and Z, respectively, with joint distribution PXY Z, for instance resulting from receiving a sequence of random bits broadcast by a satellite. We consider the problem of determining for a given distribution PXY Z whether Alice and Bob can in principle, by communicating over an insecure channel accessible to Eve, generate a secret key about which Eve's information is arbitrarily small. When X, Y, and Z are random variables that result from a binary random variable being sent through three arbitrary independent channels, it is shown that secret key agreement is possible if and only if I(X;Y jZ) ? 0, i.e., under the sole condition that X and Y have some (arbitrarily weak) statistical dependence when given Z.
Citations
| 4364 | Elements of Information Theory – Cover, Thomas - 1991 |
| 404 | Communications theory of secrecy system – Shannon - 1949 |
| 107 | Experimental quantum cryptography – Bennett, Bessette, et al. - 1992 |
| 99 | Secret key agreement by public discussion from common information – Maurer - 1993 |
| 75 | Broadcast channels with confidential messages – Csiszár, Korner - 1978 |
| 71 | An Introduction to Probability Theory and Its Applications, 3rd ed – Feller - 1968 |
| 61 | The wire-tap channel – Wyner - 1975 |
| 14 | Bounds on secret key exchange using a random deal of cards – Fischer, Wright - 1996 |
| 7 | Protocols for secret key agreement based on common information – Maurer - 1993 |
