Information-theoretic secret key agreementInformation-Theoretic Secret Key Agreement • January 8th, 2002
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality RatioInformation-Theoretic Secret-Key Agreement • September 25th, 2018
Intuitively, the entropy measures the uncertainty about a given random variable. In fact, a finite random variable X with range X satisfies 0 ≤ H(X) ≤ log|X | with equality in the lower bound if and only if PX(x) = 1 for some x ∈ X , and with equality in the upper bound if and only if X is uniform over X . We call
Daniel Jost1 , Ueli Maurer1, and João L. Ribeiro2yyInformation-Theoretic Secret-Key Agreement • July 9th, 2018
Abstract. Information-theoretically secure secret-key agreement be- tween two parties Alice and Bob is a well-studied problem that is provably impossible in a plain model with public (authenticated) communication, but is known to be possible in a model where the parties also have access to some correlated randomness. One particular type of such correlated randomness is the so-called satellite setting, where a source of uniform random bits (e.g., sent by a satellite) is received by the parties and the adversary Eve over inherently noisy channels. The antenna size deter- mines the error probability, and the antenna is the adversary’s limiting resource much as computing power is the limiting resource in traditional complexity-based security. The natural assumption about the adversary is that her antenna is at most Q times larger than both Alice’s and Bob’s antenna, where, to be realistic, Q can be very large.
Alireza PoostindouzInformation-Theoretic Secret Key Agreement • May 29th, 2020
