Unconditionally secure dynamic conference key distribution
Yvo Desmedt, V. Viswanathan · 2002
We present a non-interactive conference key distribution protocol in which all n users receive initial secrets from a trusted server. When a subset of the n users want to communicate privately, each of the users involved can without interaction compute the common key. We prove that the length of the initial secrets we use, are optimal.