Abstract. Becker and Wille derived a lower bound of only one round for multi-party contributory key agreement protocols. Up until now no protocol meeting this bound has been proven secure. We present a protocol meeting the bound and prove it is secure in Bellare and Rogaway's model. The protocol is much more efficient than other conference key agreement protocols with provable security, but lacks forward secrecy.
In REF Boyd and Nieto have introduced a one-round group key agreement protocol which is provably secure in the random oracle model.
Round-Optimal Contributory Conference Key Agreement
Public Key Cryptography
Computer Science