Group Session Key Research Articles

Shared group session key-based conditional privacy-preserving authentication protocol for VANETs

Vehicular Ad-Hoc Networks (VANETs) have significantly enhanced driving safety and comfort by leveraging vehicular wireless communication technology. Due to the open nature of VANETs, conditional privacy-preserving authentication protocol should be offered against potential attacks. Efficient and secure authentication among vehicles in VANETs are important requirements, but there are various limitations in the existing conditional privacy-preserving authentication protocols for securing VANETs. To cope with the inherent issues, we propose a conditional privacy-preserving authentication protocol based share group session key (SGSK) by integrating the self-healing key distribution technique, blockchain, and MTI/C0 protocol. In our protocol, we use SGSK instead of the time-consuming Certificate Revocation List (CRL) checking, and we revoke malicious vehicles by updating SGSK. It is shared among unrevoked vehicles within a domain and across-domain. As a result, when a malicious revoked vehicle enters a new domain, it is difficult for it to access the system and send false messages. Furthermore, our protocol can not only achieve computation efficiency by reducing the number of computing operations of bilinear pairing but also resist various attacks while keeping conditional privacy protection. We implement our protocol in the Hyperledger Fabric platform. The experimental results show that our protocol is available to revoke 180 malicious vehicles in across-domain scenarios within one second, and it can meet the requirement of verifying 600 messages per second easily. Moreover, our comprehensive performance evaluations demonstrates that our protocol outperforms other approaches in terms of vehicle revocation checking cost, computation overhead, and communication overhead. In addition, to show the feasibility and validity of our protocol, we use SUMO and NS2 to simulate the actual VANET scenario and validate the efficiency and performance of our protocol. Simulation results prove the practicability of our protocol for VANETs.

A Novel Key Agreement Protocol Applying Latin Square for Cloud Data Sharing

In the cloud computing context, group data sharing, which is highly convenient for people who intend to share data with multiple members of a group, has attracted extensive research attention. However, the question of how data security might be ensured in this scenario, particularly as regards the security of group session keys, still remains an open one. To support secure group data sharing in cloud computing, it is essential to design a key agreement protocol characterized by both high flexibility and efficiency. Accordingly, this paper proposes a key agreement protocol based on Latin Square to reinforce the security of group data sharing. This protocol supports an arbitrary number of members to participate in a group and make equal contributions to generating a common session key among themselves. Compared with previous works, both the communication and the computational complexity in this protocol are significantly reduced. In addition, the services of authentication, key confirmation and fault tolerance are provided, enabling the protocol to resist different types of attacks. The results of both theoretical and experimental analysis indicate that the proposed protocol can efficiently support secure cloud data sharing for large-scale groups.

Efficient Blockchain-Based Group Key Distribution for Secure Authentication in VANETs

This letter proposes a group key distribution scheme using smart contract-based blockchain technology. The smart contract’s functions allow for securely distributing the group session key, following the initial legitimacy detection using public key infrastructure-based authentication. For message authentication, we propose a lightweight symmetric key cryptography-based group signature method, supporting the security and privacy requirements of vehicular ad hoc networks (VANETs). Our discussion examined the scheme’s robustness against typical adversarial attacks. To evaluate the gas costs associated with smart contracts functions, we implemented it on the Ethereum main network. Finally, comprehensive analyses of computation and communication costs demonstrate the scheme’s effectiveness.

Multi-Party Quantum Key Distribution Protocol with New Bell States Encoding Mode

Security, efficiency and universality are the major concerns in distributed computation for how to communicate securely as there are a large number of nodes that require interactive authentication. These become more challenging especially for the multi-party quantum environment as it is highly complicated and heterogeneous in nature. Hence, based on bell states and unitary operation, we propose a multi-party quantum group key distribution protocol. The initial two participants are generated by election algorithm to ensure the fairness among the participants in our protocol. Next, mutual authentication is provided by two Bell states of four orthogonal maximal states, and the group session key is obtained by combining unitary operation. The main innovations of this scheme are that the authenticated information with the group key is transmitted among the ordered participants, and the efficiency of our protocol is acceptable which the time complexity of QKD is $$ O\left(\left\lceil {\mathit{\log}}_2^N\right\rceil \right) $$ with the N-party. Through security analysis and efficiency analysis, the protocol can effectively resist internal attacks and external attacks, and has feasible efficiency.

Provable Secure Group Key Establishment Scheme for Fog Computing

In the fog computing paradigms, fog nodes are closer to terminal devices and can extend services to the edge of the network, thereby reducing the impact of high latency and restricted networks in the Internet of Things (IoTs). Fog compu-ting applications usually organize the terminal devices in groups and require some form of security protection. Previous studies on the establishment of group keys for fog computing architectures have high communication costs and cannot verify the authenticity of each entity. Therefore, in this paper, we propose a mutual authentication group key establishment scheme for the fog computing architecture by using elliptic curve cryptography. After mutual authentication, the cloud server can transfer the computing overhead to the fog node, which will be responsible for authenticating the device group and distributing the established group session key. The group session key consists of the private key of each entity and some random and tempo-rarily stored values. We prove that the established group session key is protected by the Canetti-Krawczyk (CK) adversary model. Finally, we evaluate performance based on calculation and communication costs. Compared with previous studies, the proposed scheme is lightweight and effective because it only involves elliptic curve operations and symmetric cryptographic operations.

Cross-domain certificateless authenticated group key agreement protocol for 5G network slicings

Network slicing technology is a core part of 5G network, which enables users to access the suitable network on demand and increases the flexibility of network resources through appropriate network configuration. However, the group users in dynamic 5G network slices face communication security threats (impersonation attack, network monitoring, identity leakage, etc.). Group key agreement (GKA) protocol can be used to ensure the security of communication for group users. However, most GKA protocols do not consider cross-domain environment, or use the same cryptographic system parameters between all communication nodes in cross-domain environment. This study presents a cross-domain certificateless authenticated GKA protocol for 5G network slicings supporting dynamic group users management. This new scheme only needs one-round communication and allows group users from different network domains with different cryptographic system parameters to agree on a group session key in common. The proposed scheme not only can provide authenticated key agreement security, mutual authentication, perfect forward secrecy, user anonymity and partial private key transmission security, but also is able to withstand the impersonation, replay and known temporary key attacks. As compared with existing three certificateless group key agreement protocols, our proposed scheme has less computation time, and the communication overhead of low-power group user in our proposed is reduced by at least 36%.

Group-Signature and Group Session Key Combined Safety Message Authentication Protocol for VANETs

Anonymous authentication has significant contribution to privacy protection in safety message dissemination for Vehicular Ad Hoc Networks (VANETs); however, it suffers from heavy workload of vehicle revocation check and message signature verification, which leads to unsatisfactory timeliness and high message loss rate in heavy traffic situations. To manage these challenging problems, this paper proposes an efficient safety message authentication protocol for VANETs by combining batch group signature verification and our proposed Group Session Key (GSK). Specifically, our signature verification method for safety message can both achieve computation efficiency by reducing the number of computation operations of bilinear pairing and resist impersonation attack by using tracking key implement. GSK is associated with the forward and backward keys and is only shared among unrevoked vehicle within a group. Performance analysis and simulations demonstrate that our protocol can provide promising security against various common types of attackers and is more efficient than traditional group-signature-based authentication protocols, in terms of computation time cost, authentication delay and message loss rate.

A Provably Secure Group Key Agreement Scheme With Privacy Preservation for Online Social Networks Using Extended Chaotic Maps

With the rapid growth in the popularity of mobile devices and development of network technologies, various online social networking applications have grown in popularity. While these social networking sites provide benefits in terms of enhanced connectivity with people all around the world, they can also pose security threats and raise privacy concerns due to their vulnerability to be exploited by malicious agents. Such social networking sites where members can transmit or share their social information via public channels increase the risk that these information may be exposed to unwanted users. Therefore, it is important to enhance the security of these online social network services using group session keys. These group session keys also need to be updated in case a new member joins the group or an old member leaves the social group. To enhance the trustworthiness of the online social network systems, in this paper, we propose a secure chaotic maps-based group key agreement scheme. In this proposed scheme, we also provide member anonymity to ensure the privacy of the communication between the social networking platform and the members. The proposed solution does not rely on a centralized online key center or a trusted group chairman, thus ensuring fairness. We integrate the mechanisms of message encryption and member verification into the scheme to allow the members to anonymously interact with the services of the online social network. We verify the formal security of the proposed solution using the widely accepted BAN logic analysis and simulation verification with Proverif to prove that our scheme is secure against both passive and active attacks. We also demonstrate that the proposed scheme is efficient in its implementation and achieves greater functionality criteria in comparison with similar existing proposals.

Concurrently Deniable Group Key Agreement and Its Application to Privacy‐Preserving VANETs

VANETs need secure communication. Authentication in VANETs resists the attack on the receipt of false information. Authenticated group key agreement (GKA) is used to establish a confidential and authenticated communication channel for the multiple vehicles. However, authentication incurs privacy leakage, that is, by using digital signature. Therefore, the deniability is deserved for GKA (which is termed as DGKA) due to the privacy protection. In the DGKA protocol, each participant interacts with intended partners to establish a common group session key. After this agreement session, each participant can not only be regarded as the intended sender but also deny that it has ever participated in this session. Therefore, under this established key, vehicles send confidential messages with authentication property and the deniability protects the vehicles privacy. We present a novel transformation from an unauthenticated group key agreement to a deniable (authenticated) group key agreement without increasing communication round. Our full deniability is achieved even in the concurrent setting which suits the Internet environment. In addition, we design an authenticated and privacy‐preserving communication protocol for VANETs by using the proposed deniable group key agreement.

Cross-domain dynamic anonymous authenticated group key management with symptom-matching for e-health social system

Electronic health (e-health) social system provides an effective way for the patients to share their treatment experience, exchange medical information and build a supportive relationship. In this paper, we propose a novel symptom-matching based group key management scheme for the e-health social system supporting dynamic group membership change. The patients in this system are diagnosed and treated by different medical institutions. This proposed schemes allows a group of patients from different healthcare domains (cross-domain) to securely establish a group session key to protect the group disease discussion. The scheme supports patient anonymity and traceability since the identities of the patients are hidden in an anonym and their medical institution is able to recover the real identity. The group agreement protocol ensures that only the authenticated patient with the same symptom could derive the group session key. The privacy of patient’s symptom is also protected since the patient cannot know the other patients’ symptoms if they do not have the same symptom. The security of this scheme is proved and the performance is evaluated theoretically and experimentally. The simulation and comparison indicate that our scheme has good performance and suitable for the mobile e-health social system.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement DAGKA protocol is presented. It is round-optimal, since: 1 in setup and join algorithms, only one round of communication is required; 2 in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman DBDH assumption. In addition, the protocol resists key control attack and achieves forward security.

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

A novel one-round authenticated group key agreement (CL-AGKA) protocol is devised in this paper on certificateless public key cryptography. Our CL-AGKA protocol abolished the certificate management burden existing in certificate authority-based public key cryptography and the private-key escrow problem occurring in identity-based cryptography. Our CL-AGKA protocol is designed to establish an authenticated group session key between a group participants by ensuring that the session key is not revealed to any outsiders. The proposed CL-AGKA protocol designed a security model in the computational model, called the random oracle model. It is formally examined that our CL-AGKA protocol achieved the strong authenticated key exchange security and thus provably secured in the random oracle model. The security of the designed protocol is achieved against the intractability assumptions of the computational Diffie---Hellman problem and bilinear Diffie---Hellman problem. In addition, the proposed CL-AGKA protocol offered low message exchange cost and computational cost against the related group key agreement protocols.

Scalable protocol for cross-domain group password-based authenticated key exchange

Cross-domain password-based authenticated key exchange (PAKE) protocols have been studied for many years. However, these protocols are mainly focusing on multi-participant within a single domain in an open network environment. This paper proposes a novel approach for designing a cross-domain group PAKE protocol, that primarily handles with the setting of multi-participant in the multi-domain. Moreover, our protocol is proved secure against active adversary in the Real-or-Random (ROR) model. In our protocol, no interaction occurs between any two domain authentication servers. They are regarded as ephemeral certificate authorities (CAs) to certify key materials that participants might subsequently use to exchange and agree on group session key. We further justify the computational complexity and measure the average computation time of our protocol. To the best of our knowledge, this is the first work to analyze and discuss a provably secure multi-participant cross-domain group PAKE protocol.

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center. Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.

Group Session Key Exchange Multilayer Perceptron Based Simulated Annealing Guided Automata and Comparison Based Metamorphosed Encryption in Wireless Communication (GSMLPSA)

In this paper, a group session Key Exchange multilayer Perceptron based Simulated Annealing guided Automata and Comparisonbased Metamorphosedencryption technique(GSMLPSA) has been proposedin wireless communication of data/information.Both sender and receiver uses identical multilayer perceptron and depending on the final output of the both side multilayer perceptron, weights vector of hidden layer get tuned in both ends. As a results both perceptrons generates identical weight vectors which is consider as an one time session key. In GSMLPSA technique plain textis encrypted using metamorphosed code table for producing level 1 encrypted text. Thencomparison based technique is used to f urther encerypt the level 1 encrypted text and produce level 2 encrypted text. Simulated Annealing based keystream is xored with the leve2 encrypted text and form a level 3 encrypted text. Finally level 3 encrypted text is xored with the MLP based session key and get transmitted to the receiver. GSMLPSA technique uses two keys for encryption purpose. SA based key get further encrypted using Automata based technique and finally xored with MLP based session key and transmitted to the receiver . This technique ensures that if intruders intercept the key of the keystream then also values of the key not be known t o the intruders because of the automata based encoding. Receiver will perform same operation in reverse order to get the plain text back. Two parties can swap over a common key using synchronization between their ownmultilayer perceptrons. But the problem crop up when group of N partiesdesire to swap over a key. Since in this case each communicating party has to synchronize with otherfor swapping over the key. So, if there are N parties then total number of synchronizations needed before swapping over the actual key is O(N 2 ). GSMLPSAscheme offers a novel technique in which complete binary tree structure is follows for key swapping over.Using proposed algorithm a set of N parties can be able to share a common key with only O(log 2 N) synchronization. Parametric tests have been done and results are compared with some existing classical techniques, which show comparable results for the proposedtechnique.

One-way hash chain-based self-healing group key distribution scheme with collusion resistance capability in wireless sensor networks

In order to resolve the collusion resistance problem in the one-way hash chain-based self-healing group key distribution schemes and improve the performance of previous self-healing group key distribution schemes, we propose a self-healing group key distribution scheme based on the revocation polynomial and a special one-way hash key chain for wireless sensor networks (WSNs) in this paper. In our proposed scheme, by binding the time at which the user joins the group with the capability of recovering previous group session keys, a new method is addressed to provide the capability of resisting the collusion attack between revoked users and new joined users, and a special one-way hash chain utilization method and some new methods to construct the personal secret, the revocation polynomial and the key updating broadcast packet are presented. Compared with existing schemes under same conditions, our proposed scheme not only supports more revoked users and sessions, but also provides a stronger security. Moreover, our proposed scheme reduces the communication overhead, and is especially suited for a large scale WSN in bad environments where a strong collusion attack resistance capability is required and many users will be revoked.

Group Authentication: A New Paradigm for Emerging Applications

Traditional secure registration protocols rely on client-server authentication procedures. This concept has been extended to support single client registration to multiple servers, using “single sign-on” protocols. In this paper, we design a framework to solve the “reverse single sign-on” problem: How can multiple clients securely register with the same server/network in a single registration procedure? The main advantage of our framework is that it allows multiple clients to register with an infrastructure, such as a cellular network, as a “group,” yet generate individual session keys as well as a group session key. With this, the process of authenticating a large number of clients is greatly simplified, thereby dramatically reducing overheads. With a view towards simplifying the exposition, we describe how our framework can be applied for performing group authentication of devices in the machine-to-machine context. While this is an immediate area of application, we outline other extensions of the framework in the application layer including webcasting in a social networking environment. © 2012 Alcatel-Lucent.

Access‐polynomial‐based self‐healing group key distribution scheme for resource‐constrained wireless networks

ABSTRACTThe self‐healing group key distribution scheme with revocation can deal with the problem of distributing session keys for secure group communication over an unreliable wireless network, with the capability to resist packet loss and collusion attack. However, existing access‐polynomial‐based self‐healing key management schemes have some problems, such as the small number of active group members, much redundancy in the key updating broadcast packet, and limited collusion attack resistance capability. In order to increase the number of active group members and improve the performance of self‐healing group key distribution schemes, we propose a self‐healing group key distribution scheme based on the access polynomial and one‐way hash key chain for resource‐constrained wireless networks in this paper. In our proposed scheme, by binding the time at which the user joins the group with the capability of recovering previous group session keys, some novel methods to construct the personal secret, the access polynomial, and the session key updating broadcast packet are presented. Compared with existing schemes under same conditions, analysis and simulation results show that our proposed scheme not only supports much more group members and sessions, but also provides a stronger security, considering that it can deal with more colluding users. Moreover, our proposed scheme is especially suitable to resource‐constrained wireless networks in a very bad environment. Copyright © 2012 John Wiley & Sons, Ltd.

A secure mobile virtual network computing environment for agent handshake

In this paper, we proposed a secure mobile virtual computing environment for agent handshake. In mobile virtual computing environment, agent handshake often appears in mobile virtual computing, we conclude that problem into a basic secure problem. In this paper, we propose an ID-based one round authenticated group key agreement protocol with bilinear pairings for solving agent handshake problem in mobile virtual computing environment, where all agents can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, we make sure every agent’s computing environment secure. We give a comprehensive security analysis on the proposed mobile virtual computing environment. Finally, we present the efficiency analysis about the proposed mobile virtual computing environment and other schemes, the proposed schemes require lower computation cost.