In this review paper, we review the secure secret key agreement in terms of information theory and its related topics. We first describe the model introduced by Maurer, and explain that typical key agreement protocols consist of two steps: information reconciliation and privacy amplification. We also introduce some security criteria. After that, we explain Slepian-Wolf data compression as a method of information reconciliation. Then, we describe a method of privacy amplification that has been widely used in the literature. In particular, we point out that the secret key generated by this method satisfies the so-called weak security criterion, but it does not satisfy the other security criteria. Then, we explain a method of privacy amplification that satisfies the other security criteria. Furthermore, we also explain the multiterminal source coding problem and the multiterminal random number generation problem, which are generalizations of Slepian-Wolf coding and privacy amplification, respectively. As applications of these techniques, we explain the multiparty secret key agreement and the secure function computation.
View full abstract