Paper Details

In two-server password-authenticated key exchange (PAKE) protocol, a client splits its password and shops twostocks of its password within the servers, respectively, and the two servers then cooperate to authenticate the patron withoutknowing the password of the consumer. In case one server is compromised by means of an adversary, the password of thepurchaser is needed to stay cozy. In this paper, we present compilers that remodel any two-celebration PAKE protocol to atwo-server PAKE protocol on the premise of the identification-based totally cryptography, known as ID2S PAKE protocol.By the compilers, we are able to assemble ID2S PAKE protocols which acquire implicit authentication. As long as theunderlying -birthday party PAKE protocol and identity-based absolutely encryption or signature scheme have provableprotection without random oracles, the ID2S PAKE protocols built by way of the compilers may be established to be securewithout random oracles. Compared with the Katz et al.’s -server PAKE protocol with provable protection without randomoracles, our ID2S PAKE protocol can shop from 22% to 66% of computation in each server.

DOKKU. SRIJA, Dr. R. CHINA APPALA NAIDU, “ID BASED DOUBLE SERVER GENUINE KEY REPLACE”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 11, pp. 20-24, November 2017.