The ABE schema has finely granular data access control that can be applied to many scenes where KA protocols are used. As shown in the example above, the EBA scheme for authenticating attributes between protocol participants was taken over and did not reveal their identity. More and more KA protocols are setting up ABE schemes to build TP-AB-KA protocols. However, the length of the key and code in these TP-AB-KA protocols increases linearly with the number of attributes that subscribers own or are embedded in access policies. Obviously, these TP-AB-KA protocols are not suitable for easy applications. For example, mobile devices have become the primary devices in the open cloud, which are resource-constrained and require high-performance protocols. To solve the above problem, we first propose a key protocol of understanding based on attributes, with encryption text and keys of constant size, based on the CP-ABE scheme . The key agreement (KA) protocol is an important part of cryptography. By creating a meeting key, the KA protocol provides confidentiality, integrity, and availability security services for open communication on the network node. Recently, the key two-part protocol (TP-AB-KA) was first proposed in . In the TP-AB-KA protocol, attribute-based encryption (ABE) for the exchange of secret messages was taken up by two participants. This type of minutes performs negotiation-based meeting keys based on mutual authentication of participants` attribute information.
Sahai and Waters  first proposed ABE, which was used for fine-grained access control for cloud storage. The identity of the user is determined by its attributes. ABE is often used in a one-to-one encryption situation, where data encrypted with certain attributes is properly decrypted by all users whose attributes meet that access structure. The TP-AB-KA protocol inherits the benefits of ABE schemes, for example. B the use of attributes to describe a user and achieve the protection of the user`s identity. In this way, TP-AB-KA protocols can also meet the requirements of certain application scenarios in which participant attributes are a critical factor in mutual authentication. The initial and still most famous protocol of the key agreement was proposed by Diffie and Hellman (see the key agreement Diffie Hellman) as well as their concept of public key cryptography. In principle, users send the Alice and Bob Public Key values through an uncertain channel. Based on the knowledge of their corresponding private keys, they are able to calculate a common key value correctly and securely. However, an earpiece is not able to calculate this key in the same way by simply knowing the.
Calling keys to the password is a process in which a client obtains a static key in a password-based negotiation with a server that knows the data associated with the password, for example. B the Ford and Kaliski methods. In the strictest setting, a party uses only one password associated with N servers (two or more) to retrieve a static key. This is concluded in a way that protects the password (and key), even if N − 1 of the servers are completely compromised. In cryptography, a password-authenticated key agreement method is an interactive two- or more-party method for creating cryptographic keys based on the knowledge of one or more parties through a password….