Information-Theoretic Security in Cryptography
Amin Aminzadeh Gohari, Venkat Anantharam and Martin Wainwright
In many environments requiring secret key generation, it is possible to provide external randomness to the agents. For example, sensor networks are often deployed in places where it is possible to beam randomness, e.g., from a satellite.
We use information-theoretic tools to study the fundamental problem in cryptography in which Alice, Bob, and Eve have access to possibly correlated random sources. We study the secret key rate of Alice and Bob (secret from Eve). We define a new Slepian-Wolf type problem and prove that the secret key rate reduces to a problem of this type. This parallels known results when there is no external randomness. Furthermore, using the new Slepian-Wolf type problem, we develop techniques to improve the best known bounds on the secret key generation capacity of Alice and Bob hidden from Eve.