Password-Authenticated Key Agreement Protocols
A considerable number of secure PAKE substitution protocols have been given in the work of Mr. Bellare, D. Pointcheval and P. Rogaway, variations, and security evidence has been proposed in this growing class of key password aesthetic tuning methods. Current standards for these methods include iETF RFC 2945, RFC 5054, RFC 5931, RFC 5998, RFC 6124, RFC 6617, RFC 6628 and RFC 6631, IEEE Std 1363.2-2008, ITU-T X.1035 and ISO-IEC 11770-4:2006. If that were all we needed, PAKE protocols would be easy to create. What makes a PAKE really useful is that it should also offer protection for the customer`s password. A stronger version of this warranty may be indicated as follows: After an attempt to log in (valid or not), the client and the server should only know if the client`s password corresponds to the expected value of the server, and no additional information. It`s a strong guarantee.
Indeed, what we require of zero proof of knowledge is not without equal. The first step in PAKE`s search came in 1992, when Bellovin and Merrit initiated the exchange of encrypted keys . This article includes the so-called hybrid method, in which the password is only an additional layer of security in addition to the public key. The other thesis, in fact stricter, was introduced in the document, written by S. Bellovin and Mr. Merritt in 1992.  However, it appears that there was no evidence of security in the protocol described, including safely, which should be applied in different threat models. The first de PAKE protocols were developed by M. Bellare, D. Pointcheval, P. Rogaway  and V.
Boyko, P. MacKenzie, S. Patel . The safety evidence of these protocols was described in the application on the random oracle model. A little after the current thesis on the different threat patterns was generalized.  and the possibility of safe negotiation, even in most powerful headphones, has been proven.  Today, protocols considered part of PAKE are among the most common cryptographic primitives due to the need for the PAKE protocol family, as the distribution of the public key is necessary to perform high-level tasks, such as encryption and MAC calculation. When it comes to important agreements, the parties need the information that each of the parties would have.
As is well known, the most common approach is currently the key to raspredeleraspredeleniyu preliminary exchange of public keys between parties, then send encrypted cryptographic keys. There are many in the accuracy of such protocols and similar ones that are normally based on the Diffie-Hellman protocol. However, all of these reports have a common fundamental error – they are faced with listening and offer no mechanism for authentication sites, let alone confirmation of the possession of the key to counter the imposition of traffic. Thus, if the certificate containing the public key of the second part has been intercepted in one way or another and replaced by its own intruder, if the type certificate of the recipient is not really known, listen without being spotted. Similarly, the applicability of the DE PAKE protocol family may be justified by the interactivity requirements when spreading the attackers` password, as opposed to absolute in the case of non-interactive authentication for conventional protocols based on the diffie-Hellman protocol. Multi-party and multi-server methods here is just modifying the known protocols used for transferring the cryptographic key among parties that have a common low entropy password. Most multi-party cases use balanced methods and most multi-server modifications of advanced methods. Ford and Kaliski described the first key call methods verified in 2000. If the client wants to authenticate with the OPAQUE protocol, the server sends him the recorded C encryption text.