scholarly journals On Constructing Dynamic and Forward Secure Authenticated Group Key Agreement Scheme from Multikey Encapsulation Mechanism

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Iraj Fathirad ◽  
John Devlin
Keyword(s):  
Elliptic Curve ◽  
Key Agreement ◽  
Forward Secrecy ◽  
Group Key ◽  
Communication Round ◽  
Group Key Exchange ◽  
Generic Construction ◽  
Authenticated Group Key ◽  
The Cost ◽  
Group Environments

The approach of instantiating authenticated group key exchange (GAKE) protocol from the multikey encapsulation mechanism (mKEM) has an important advantage of achieving classical requirement of GAKE security in one communication round. In spite of the limitations of this approach, for example, lack of forward secrecy, it is very useful in group environments when maximum communication efficiency is desirable. To enrich thismKEM-based GAKE construction, we suggest an efficient solution to convert this static GAKE framework into a partially dynamic scheme. Furthermore, to address the associated lack of forward-secrecy, we propose two variants of this generic construction which can also provide a means of forward secrecy at the cost of extra communication round. In addition, concerning associated implementation cost of deploying this generic GAKE construction in elliptic curve cryptosystem, we compare the possible instantiations of this model from existingmKEM algorithms in terms of the number of elliptic curve scalar multiplications.

scholarly journals A Provably Secure Revocable ID-Based Authenticated Group Key Exchange Protocol with Identifying Malicious Participants

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Tsu-Yang Wu ◽  
Tung-Tso Tsai ◽  
Yuh-Min Tseng
Keyword(s):  
Key Exchange ◽  
Public Key ◽  
Key Exchange Protocol ◽  
Forward Secrecy ◽  
Group Key ◽  
Computation Technique ◽  
Group Key Exchange ◽  
Security Properties ◽  
Authenticated Group Key ◽  
Provably Secure

The existence of malicious participants is a major threat for authenticated group key exchange (AGKE) protocols. Typically, there are two detecting ways (passive and active) to resist malicious participants in AGKE protocols. In 2012, the revocable identity- (ID-) based public key system (R-IDPKS) was proposed to solve the revocation problem in the ID-based public key system (IDPKS). Afterwards, based on the R-IDPKS, Wu et al. proposed a revocable ID-based AGKE (RID-AGKE) protocol, which adopted a passive detecting way to resist malicious participants. However, it needs three rounds and cannot identify malicious participants. In this paper, we fuse a noninteractive confirmed computation technique to propose the first two-round RID-AGKE protocol with identifying malicious participants, which is an active detecting way. We demonstrate that our protocol is a provably secure AGKE protocol with forward secrecy and can identify malicious participants. When compared with the recently proposed ID/RID-AGKE protocols, our protocol possesses better performance and more robust security properties.

Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks

2007 ◽  
Vol 177 (23) ◽  
pp. 5441-5467 ◽  
Author(s):  
Junghyun Nam ◽  
Juryon Paik ◽  
Ung Mo Kim ◽  
Dongho Won
Keyword(s):  
Wireless Networks ◽  
Key Exchange ◽  
Group Key ◽  
Group Key Exchange ◽  
Authenticated Group Key ◽  
Resource Aware
Sign in / Sign up

Export Citation Format

Share Document