Multi Decryption Key Agreement in Dynamic Peer Group

Abstract

Ever since multi decryption key agreement was first proposed in 2002, there have been efforts to extend its simplicity and elegance to group communication, it has some advantages in rekeying comparing to symmetric key group key management schemes. Notable solutions have been proposed by OMGKM, AGKA and AKGM. In this paper, we consider a class of protocols that we call natural extensions of multi decryption key to the n-party case for distributed networks. Two novel and practical protocols are put forwards and are compared with the exiting protocols, the proposed protocols are optimal with respect to protocol security and efficiency.