A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie–Hellman with privacy preserving public key infrastructure

Abstract

In this paper a new two-round authenticated contributory group key agreement based on Elliptic Curve Diffie-Hellman protocol with Privacy Preserving Public Key Infrastructure (PP-PKI) is introduced and is extended to a dynamic authenticated contributory group key agreement with join and leave protocols for dynamic groups. The proposed protocol provides such security attributes as forward secrecy, backward secrecy, and defense against man in the middle (MITM) and Unknown keyshare security attacks and also authentication along with privacy preserving attributes like anonymity, traceability and unlinkability. In the end, they are compared with other popular Diffie-Hellman and Elliptic Curve Diffie-Hellman based group key agreement protocols and the results are found to be satisfactory. Keywords. Secure group communication (SGC); mobile ad-hoc networks (MANETS); dynamic authenticated group key agreement (DAGKA); elliptic curve Diffie-Hellman (ECDH); privacy preserving public key infrastructure (PP-PKI).

A provably secure sharding based blockchain smart contract centric hierarchical group key agreement for large wireless ad‐hoc networks

“…The greater part of distributed/contributory-GKAs is extensions or generalizations of 2-party DH. [2][3][4][5][6] The management of keys in contributory/distributed-GKA [7][8][9][10][11] is less complex to deal with within each cluster/subgroup relative to approaches that deal with the entire group. In this direction, contemporary works 5,6,[12][13][14][15][16][17] chose cluster/subgroup-based schemes 14,16 in which the entire group is divided into clusters.…”

A provably secure cluster-based hybrid hierarchical group key agreement for large wireless ad hoc networks

“…Two-party DH-key agreement [34] is the origin for enormous amount of consequent GKA schemes. The majority of distributed/contributory-GKA protocols rely on generalizations of 2-party DH or its extensions [3,7,16,[35][36][37][38][39]. Key management in distributed/contributory-GKA are less difficult to deal with in each subgroup/cluster compared to the whole ad hoc network.…”

“…The majority of CK-GKAs' [18,20,21,25,26,30,31,35,39,[40][41][42] presume a hierarchical framework of the clusters or hierarchical structure, then execute a natural key agreement schemes such as, D-H [34] or the Burmester and Desmedt (BD) [3] GKA scheme, or a variety GKA schemes [3,7,16,[35][36][37][38][39] is at first implemented locally in each cluster, after that utilize these CKs in the next level with equivalent or an alternate key agreement scheme among CHs' to generate the whole group key. For further information on a comparison of the existing protocols [18,21,25,26,28,30,31,33,43] in this direction, one can refer to Table 2, summary of the key characteristics of cluster based protocols.…”

“…Further, most of the traditional GKA schemes stated in the literature are unable to handle the dynamic nature (joining and leaving of nodes from the clusters) in WANETs. In precise, the renowned protocols in [3,11,36,38] competent for wired networks, may not be applicable to the WANETs due to their enormous dynamism. On the other hand, clustering strategy empowers hubs to be sorted out in a various levelled ad hoc network dependent on their relative nearness to each other, along these lines debilitating the one hop presumption in natural GKA protocols.…”

A Homomorphic Crypto System for Electronic Election Schemes

“…In cryptographic algorithm the procedures of Key generation, Encryption and Decryption is used. It also provides zero knowledge proofs that the contents of the encrypted vote check for the validity [16]. After voting has closed, the voting authorities use the Encryption Schemes.…”