01017nas a2200193   4500000000100000000000100001008004100002260000900043653002100052653002300073653003000096653001900126100002100145700001900166245006300185300001100248490000700259520055700266       2013                            d  c201310abilinear Pairing10achallenge-response10aGap Diffie-Hellman Groups10aIdentification1 aMassoud Dehkordi1 aReza Alimoradi00aChallenge-Response Schemes Using Gap Diffie-Hellman Groups  a98-1080 v263 a<p>The increasing use of identification protocols in the recent years has made the secure identification one of the most important research issues in the advanced cryptography and the computer network security. Therefore, in this paper, using the basic designing of identification protocols, we introduce identification protocols in which the gap Diffie–Hellman group and the bilinear pairing have been used. In these schemes, some of the current challenge-response identification protocols have been improved in terms of efficiency and security.</p>