Information Security and Cryptography Research Group

New Bounds in Secret-Key Agreement: The Gap Between Formation and Secrecy Extraction

Renato Renner and Stefan Wolf

Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 562–577, May 2003.

Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the extraction of information-theoretically secret bits. The best known upper bound on the rate S at which such key bits can be generated has been the intrinsic information of the distribution modeling the parties', including the adversary's, knowledge. Based on a new property of the secret-key rate S, we introduce a conditional mutual information measure which is a stronger upper bound on S. Having thus seen that the intrinsic information of a distribution P is not always suitable for determining the number of secret bits extractable from P, we prove a different significance of it in the same context: It is a lower bound on the number of key bits required to generate P by public communication. Taken together, these two results imply that sometimes, (a possibly arbitrarily large fraction of) the correlation contained in distributed information cannot be extracted in the form of secret keys by any protocol.

BibTeX Citation

    author       = {Renato Renner and Stefan Wolf},
    title        = {New Bounds in Secret-Key Agreement: The Gap Between Formation and Secrecy Extraction},
    editor       = {Eli Biham},
    booktitle    = {Advances in Cryptology --- EUROCRYPT 2003},
    pages        = {562--577},
    series       = {Lecture Notes in Computer Science},
    volume       = {2656},
    year         = {2003},
    month        = {5},
    publisher    = {Springer-Verlag},

Files and Links