Paper 2012/395
A New Efficient Authenticated ID-Based Group Key Agreement Protocol
Morteza Arifi, Mahmoud Gardeshi, and Mohammad Sabzinejad Farash
Abstract
Group key agreement (GKA) protocols Play a main role in constructing secure multicast channels. These protocols are algorithms that describe how a group of parties communicating over a public network can gain a common secret key. ID-based authenticated group key agreement (AGKA) cryptosystems based on bilinear pairings are update researching subject because of the simplicity of their public key management and their efficiency. The key agreement protocol is a good way to establish a common session key for communication. But in a group of member’s communication, we not only need to establish a common session key, but also need to concern the member changing situation. In this paper we propose a protocol based on Weil pairing, ID-based authentication and complete ternary tree architecture. We show that our protocol satisfies all known security requirements, and therefore it is more secure and efficient than the compared group key exchange protocols that we discuss in this article.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Group key agreementID-based AuthenticationPairingTernary Tree.
- Contact author(s)
- sabzinejad @ tmu ac ir
- History
- 2012-07-23: received
- Short URL
- https://ia.cr/2012/395
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/395,
author = {Morteza Arifi and Mahmoud Gardeshi and Mohammad Sabzinejad Farash},
title = {A New Efficient Authenticated {ID}-Based Group Key Agreement Protocol},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/395},
year = {2012},
url = {https://eprint.iacr.org/2012/395}
}
