Security and Communication Networks

Research Article

A Secure and Anonymous Two-Factor Authentication Protocol in Multiserver Environment

Table 5

Performance comparison among relevant schemes in multiserver.
 Computation overheadCommunication costThe proposed fourteen evaluation criteria
 LoginAuthenticationLoginAuthenticationS1 S2 S3 S4 S5 S6 S7 S8 S9 S10 S11 S12 S13 S14
Leu and Hsieh (2009) [19]  512 bits384 bits
Li et al. (2012) [20]++1280 bits1280 bits
Amin (2012) [17]768 bits896 bits
Maitra et al. (2016) [18]+640 bits1280 bits
Kumari et al. (2017) [41]++2176 bits9088 bits
Irshad et al. (2017) [42]++++2176 bits4480 bits
Irshad et al. (2017) [43]+384 bits512 bits
Our scheme+++1408 bits1664 bits
is the time of modular exponentiation operation, is the time of scalar multiplication on elliptic curve, is the time of hash computation, and is the time of symmetric encryption/decryption; and the lightweight operation such as “XOR” and “” can be ignored [2]. Let be 32-bit long; let , , , output of symmetric encryption, timestamp, and random numbers be 128-bit long; let , , be 1024-bit long [2]. means the property is satisfied; means the property is not satisfied; means the property is not related to the scheme.