Member-only story
Conference keying — the Burmester-Desmedt method
With conference keying, we have t participants, and each of these generates a secret value (r_i), and then transmit a public value generated from this (Z_i). Each of the participants then uses these values, and their secret value, and will generate the same secret key (K_i). In the following, we will use the Burmester-Desmedt method [1], and have five participants, and with varying sizes of a shared prime number (p), and for a common generator (g):
In the Burmester-Desmedt conference keying method, we have t users and then need to generate a common key (K):
First, everyone agrees on a prime number (p) and a generator (g). Next, for each participant i, each user generates a random number (r_i), and then compute a public value:
Each user then shares this value with the rest of the participants. Each participant then computes:
