Group Key Agreement Protocol
Let G1 be an additive group and G2 is a multiplier group. Both have the same Primordenq, q≥2k-1 and k being a security setting. G1 is produced by g1, which means G1-g1-, and the discrete logarithmic problems of G1 and G2 are difficult. We call it an authorized mating if e: G1 × G1 → G2 fulfills the following characteristics: some of the achievements of the proposed HGKA-OA protocol are discussed in this section. First of all, we have the veracity of our draft protocol. Second, the HGKA-OA safety analysis is carried out. Finally, the analysis of the effectiveness of the HGKA-OA protocol is attested. To validate the benefit fees of the proposed protocol, the following rates are proven. Theorem 1 ContributivenessBy the proposed HGKA-OA protocol, group keys subject to assessment can be produced by all HGKA-OA participants. The asymmetric group key agreement is that the group members negotiate a pair of public/private keys to encrypt or decipher the information exchanged in this document, we have proposed a HGKA-OA protocol to ensure the security group`s communication for cloud computing networks. For the exchange of information between members of the group who may have different secret levels, we have proposed a secret technology combining key factors to exchange requirements in three dimensions, requirements for complex spatial security information.
The protocol ensures that calculation and communication are as simple as possible. The security of this protocol is based on the GKA (Key Agreement Group) protocols that allow participants to deduce a key based on their contribution through a public network without central authority. They also offer effective ways to change the key when participants change. While some of the proposed GKA protocols use resources to use restriction devices, which are often present in ad hoc networks, others do not have a formal security analysis. In this article, we propose a simple, effective and safe GKA protocol, adapted to ad hoc networks, which presents the results of our implementation in a prototype application. For the difference between “secret sensitivity” and “terminal authorizations,” the exchange of information may require different groups of members of the same group. The group key agreement is one of the key technologies to ensure the exchange of group information in the field of information security. A hierarchical protocol for the group keys agreement is therefore needed to respond to the demand for the exchange of security information between members of the group with different qualifications. To meet this need, this document presents a hierarchical group key protocol with guidance attributes. As an online health concept, telemedicine uses telecommunications and information technologies to provide remote health care. Telecare Medicine Information System (TMIS) is now a widespread application.
Through these online health systems, physicians can obtain variation in patient conditions and perform treatments quickly and accordingly. Recently, researchers used Chebyshev`s chaotic maps in the TMISs authentication process. Unfortunately, many types of security vulnerabilities occur, for example.B. online consulting attacks, penetration of user anonymity and session key agreement in related work. To overcome the drawbacks, we offer a secure remote authentication system using chaotic cards. We use formal evidence in a random oracle model and the famous Proverif verification tool to prove the safety of the proposed scheme.