Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

Fig 1.

Authentication process of the GLOMONET environment.

More »

Fig 1 Expand

Fig 2.

Example of user anonymity not being satisfied.

More »

Fig 2 Expand

Fig 3.

Example of user non-traceability not being satisfied.

More »

Fig 3 Expand

Table 1.

Notation used in Ahmed et al.’s scheme.

More »

Table 1 Expand

Fig 4.

Incomplete verification of identity and password in Ahmed et al.’s scheme.

More »

Fig 4 Expand

Fig 5.

Session key derived attack in Ahmed et al.’s scheme.

More »

Fig 5 Expand

Fig 6.

Registration phase of proposed scheme.

More »

Fig 6 Expand

Fig 7.

Login phase of proposed scheme.

More »

Fig 7 Expand

Fig 8.

Authentication phase of proposed scheme.

More »

Fig 8 Expand

Fig 9.

Password change phase of proposed scheme.

More »

Fig 9 Expand

Fig 10.

ProVerif simulation code for channels, constants, secret key, shared key, and functions.

More »

Fig 10 Expand

Fig 11.

ProVerif simulation code for mobile node process.

More »

Fig 11 Expand

Fig 12.

ProVerif simulation code for foreign node process.

More »

Fig 12 Expand

Fig 13.

ProVerif simulation code for the home node process.

More »

Fig 13 Expand

Fig 14.

ProVerif simulation code for queries.

More »

Fig 14 Expand

Fig 15.

ProVerif simulation result for proposed scheme.

More »

Fig 15 Expand

Fig 16.

Architecture of the AVISPA Tool.

More »

Fig 16 Expand

Fig 17.

AVISPA simulation result for proposed scheme.

More »

Fig 17 Expand

Table 2.

Security comparison of the proposed scheme and other related schemes.

More »

Table 2 Expand

Fig 18.

Resistance of proposed scheme to mobile mode impersonation attack.

More »

Fig 18 Expand

Table 3.

Notation for the execution time of each operation.

More »

Table 3 Expand

Fig 19.

Computation time for each GLOMONET environment scheme.

More »

Fig 19 Expand

Table 4.

Computation time of each operation.

More »

Table 4 Expand

Fig 20.

Computation cost analysis between proposed scheme and existing schemes.

More »

Fig 20 Expand

Table 5.

Communication cost(bit) of each operation.

More »

Table 5 Expand

Fig 21.

Detailed analysis by each communication message between our proposed scheme and existing scheme.

More »

Fig 21 Expand

Fig 22.

Communication cost analysis between our proposed scheme and existing scheme.

More »

Fig 22 Expand

Fig 23.

Comparison of memory capacity of the smartcard in our proposed scheme with those of existing schemes.

More »

Fig 23 Expand

Fig 24.

Topology of our simulation environment (when there are 10 mobile nodes).

More »

Fig 24 Expand

Fig 25.

Throughput according to the number of mobile nodes.

More »

Fig 25 Expand

Fig 26.

Packet loss ratio according to the number of mobile nodes.

More »

Fig 26 Expand

Fig 27.

End-to-end delay according to the number of mobile nodes.

More »

Fig 27 Expand