Security Analysis Approaches for Group Key Agreement Protocols

Wei Da-wei

Published Jan 1, 2011• 0 citations

Abstract

Group Key agreement allows multi users to establish a common session key though insecure channels.Designing secure group key agreement protocols is one of the most fundamental cryptographic tasks.This paper introduced two approaches developed for analyzing security group key agreement protocols:computational complexity approach and formal analysis approach.The key technologies of computational complexity approach were discussed,including the proof technology based on reduction and simulatability,and security models based on reduction and simulatability.The trends in this field were presented.

Related papers

Constructing group key agreement protocols using mKEMs

Konstantina Papadopoulou

Over the last few years, researchers have introduced many group key agreement protocols, aiming to construct new efficient schemes in terms of both computation and communication. Group key agreement protocols aim to derive a common session key among a group of users, which will be used later in order to achieve secure communication between them. In this thesis, we provide a complete analysis of the protocols that have already been introduced in the literature from 2010 until now and require only one round. The main goal of this analysis is to evaluate these protocols in both communication and computation cost, in order to provide a comprehensive comparative analysis. The second part of the thesis is to analyze and evaluate the multi key encapsulation mechanisms that exist in the literature. A multi key encapsulation mechanism is the encryption technique by which a symmetric cryptographic algorithm is combined with an asymmetric one. To be more specific, such a mechanism uses an asymmetric cryptographic algorithm, as a method to encrypt the session key, while the key is derived by a symmetric cryptographic algorithm. Finally, we propose two new group key agreement protocols which use the multi key encapsulation mechanisms, and compare them with existing group key agreement protocols. These constructions are based on a generic methodology for creating a group key exchange protocol by using multi key encapsulation mechanisms. For this reason, emphasis has been given to both one round group key agreement protocols and multi key encapsulation mechanisms, in order to examine the possibility of combining them

Feb 26, 20180 citations

Security analysis of authenticated key agreement protocols and digital signature schemes

Peter Nose

Key agreement and digital signature are two significant and most useful contributions of modern cryptography. Such protocols and schemes allow two or more parties to establish a common session key securely in the presence of a malicious adversary and provide means of ensuring data origin authentication, data integrity and non-repudiation. Thus, secure key agreement protocols and signature schemes are fundamental building blocks for constructing complex higher-level protocols. In this thesis, we deal with security analysis of existing key agreement protocols and digital signature schemes. We examine ten authenticated key agreement protocols without key confirmation, out of which half are two-party and the other half are three-party, and one deterministic identity-based aggregate signature scheme. By giving concrete attacks, we show that these protocols and the scheme do not possess the desirable security attributes or security attributes claimed by their authors. We also present a secure deterministic identity-based signature scheme that supports partial aggregation. First, we show that Okamoto's and Chen et al.’s protocol cannot withstand the key-compromise impersonation attack and that Tan et al.’s, Lim et al.’s and two protocols of Holbl et al. are insecure against the impersonation attack and the man-in-the-middle attack. Next, we prove that one protocol of Holbl et al. is vulnerable to the insider attack, one to the unknown key-share attack, one protocol allows an adversary to compute the private key of any user and one protocol allows her to compute the shared session key. We also show that Selvi et. al.'s deterministic identity-based aggregate signature scheme is universally forgeable, i.e., anyone is able to easily generate valid signatures on any messages of his choice having on average twelve genuine digital signatures. In the end, we introduce a new deterministic identity-based signature scheme and formally prove its security in the random oracle model. The scheme is a major improvement of the signature scheme proposed by Selvi et. al. and offers the same tight security reduction to the underlying gap Diffie-Hellman problem. Because the newly proposed scheme is deterministic it allows partial aggregation, i.e., all the signatures from the same signer can be aggregated into one single short signature.

Mar 17, 20140 citations

Analysis on Security Proof of Two Key Agreement Protocols

Hui Hua Zhou, Ming Hui Zheng

Recently, Tseng proposed two group key agreement protocols which are claimed to be provably secure against passive attackers and impersonation attacks over authenticated channel. In each of these works, a security proof of the proposed protocol was presented. In this paper, we revisit Tseng’s security proof and show that the reduction in the proof is invalid. As the replacement, we give a new security proof.

Advanced materials researchJan 1, 20110 citations

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, LI Daxing

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.

Computational Intelligence and SecurityDec 15, 20072 citations

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, Daxing Li

International Conference on Computational Intelligence and Security Workshops (CISW)Dec 1, 20071 citation

Key Agreement and Authentication Protocols in the Internet of Things: A Survey

Sabina Szymoniak, Shalini Kesar

The rapid development of Internet of things (IoT) technology has made the IoT applicable in many areas of life and has contributed to the IoT’s improvement. IoT devices are equipped with various sensors that enable them to perform the tasks they were designed for. The use of such devices is associated with securing communication between devices and users. The key stages of communication are the processes of authentication and the process of agreeing on session keys because they are the basis of the subsequent communication phases. The specially designed security protocols are used to secure communication. These protocols define the course of communication and cryptographic techniques employed for securing. In this article, we have reviewed the latest communication protocols designed to secure authentication processes and agree on session keys in IoT environments. We analyzed the proposed protocols’ security level, vulnerability, and computational and communication costs. We showed our observations, describing the requirements that a secure protocol should meet.

Applied SciencesDec 28, 202237 citations