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.