A Survey on Implementation of Secure ID2S Password-Authenticated Scheme based on Key Exchange Protocols

In two-server password authenticated key exchange (PAKE) protocol, a client parts its password and stores two shares of its password in the two servers, individually, and the two servers then collaborate to verify the client without knowing the password of the client. In the event that one server is exchanged off by a foe, the secret key of the client is required to stay secure. In this paper, we display two compilers that change any two-party PAKE protocol to a two-server PAKE protocol on the premise of the identity based cryptography, called ID2S PAKE protocol. By the compilers, we can build ID2S PAKE protocols which accomplish verifiable verification. For whatever length of time that the fundamental two-party PAKE protocol and identity based encryption or mark plot have provable security without arbitrary prophets, the ID2S PAKE protocols built by the compilers can be turned out to be secure without arbitrary prophets. Compared with the Katz et al's. two-server PAKE protocol with provable security without arbitrary prophets, our ID2S PAKE protocol can spare from 22% to 66% of calculation in every server.