We consider the following scenario involving three honest parties, Alice, Bob, and Carol, as well as an adversary, Eve. Each party has access to a single piece of information, jointly distributed according to some distribution P. Additionally, authentic public communication is possible from Alice to Carol and from Bob to Carol. Their goal is to establish two information-theoretically secret keys, one known to Alice and Carol, and one known to Bob and Carol. We derive joint bounds on the lengths of these keys. Our protocols combine distributed variants of Slepian-Wolf coding and the leftover hash lemma. The obtained bounds are expressed in terms of smooth Rényi entropies and show that these quantities are useful in this-single-serving-context as well. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Renner, R., Wolf, S., & Wullschleger, J. (2009). Trade-offs in information-theoretic multi-party one-way key agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4883 LNCS, pp. 65–75). https://doi.org/10.1007/978-3-642-10230-1_5
Mendeley helps you to discover research relevant for your work.