In cryptography, a key method of agreement with password authentication is an interactive method for two or more parties to set up cryptographic keys based on the knowledge of a password by one or more parties. Typically, the duration of an AKA protocol consists of approximately a computational time and a transfer time. We can only consider airtime here, since we already know the corresponding calculation time of each protocol. In terms of transmission time, we believe that transmission time is mainly related to message size and hardware power. We assume that these hardware devices have similar performance. So if the message size is longer, it will take longer to transfer it. Fortunately, we analyzed the size of the messages in these protocols in the analysis of computational costs. Key calling, verified by the password, is a process in which a customer receives a static key in a password-based negotiation with a server that knows the password data. B for example the Ford and Kaliski methods.
In the strictest configuration, a party uses only one password associated with N servers (two or more) to retrieve a static key. This is completed in such a way as to protect the password (and key) even if the server`s N-1 is completely compromised. If you have a way to ensure the integrity of a freed key via a public channel, you can exchange Diffie-Hellman keys to deduct a short-term released key and then authenticate that the keys match. One option is to use a key reading, as in PGPfone. However, voice authentication assumes that it is not possible for a middle man to summon the voice of one participant in real time to another, which may be an undesirable hypothesis. These protocols can be designed to work even with a small public value, for example. B a password. Variations on this topic have been proposed for Bluetooth coupling protocols.
(ii) Requests. To deal with the query at SessionKeyReveal and three hate issues, and to deal with, challenger S stores four tables and , . And S uses the following options to answer questions posed by C.(1). S has a blank list in the form of . i) If the corresponding entry is already available, S returns to the opposing C. (ii) if not, S searches for the target element throughout the table. If the item is found and the value is i A or B, challenger S checks if, and . If all is correct, S places and stores the new entry in the list. If the input of the target (A and B are not the correct value of i), s. S then adds the new entry to the list. Otherwise, if the corresponding entry is not in the list or is not in the list and is not correct, select S and enter the list.
(2) EphemeralKeyReveal (). Opponent C acquires the temporary secret key of the entrance which is returned by S.(3) StaticKeyReveal (). If A or B is the correct value of i, challenger S completes this program. Otherwise, C. (4) Send (, M) is transferred. An empty table is always held by S, whose shape is. i) If i is equal to A, his temporary secret key is accidentally registered by challenger S and the value is given to C. Then S looks for the relevant point in the table.