Date Added: Mar 2011
A new algorithm for efficient key management for secure group communication in P2P network is presented. The protocol avoids the escrow problem in identity-based cryptosystem and the secure delivery of private keys. It has two rounds and requires constant pairing operation per user. The security of protocol is based on some underlying problems closely related to the Bilinear Diffie-Hellman Problem are computationally hard. P2P networks refer to a class of systems and applications that employ distributed resources to perform a function in a decentralized manner. In a P2P network, the traditional distinction between clients and back-end (or middle tier application) servers is simply disappearing, where all the participating computers/nodes are able to interact directly with each other.