• P.R.Vijayalakshmi

Today’s computing environments such as internet conferencing, distributed simulation, multi-user games, and many more applications involve Dynamic Peer Groups (DPGs). Regardless of the application environment, security services are necessary to provide communication privacy and integrity. Also, at the same time, the communication must be fast and cost-effective. In the recommended identity-based authenticated key agreement scheme, bilinear mapping is used to compute the secret key. Since the bilinear mapping computing imposes a greater computational cost, it is utilized only during the secret key computation. The proposed scheme is compared with the other related protocols by considering the computation and transmission costs. The computation costs are analyzed in terms of number of cryptographic operations. The transmission load of messages is considered as the transmission costs in the proposed identity-based scheme.

Key agreement protocol, bilinear mapping, dynamic peer groups, communication privacy, integrity, secret key

"Efficient Key Generation In New Multi-Party Key Agreement Protocol", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.938-945, June 2019, Available :http://www.jetir.org/papers/JETIR1906J75.pdf

"Efficient Key Generation In New Multi-Party Key Agreement Protocol", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp938-945, June 2019, Available at : http://www.jetir.org/papers/JETIR1906J75.pdf