An efficient identification protocol secure against concurrent-reset attacks

In this paper, first we discuss the security model for deterministic challenge-response identification protocols. For such protocols, we are able to simplify the CR2 security model in [Bellare, Fischlin, Goldwasser, and Micali, Identification protocols secure against reset attacks: 495–511, Springer, 2001] which captures concurrent attacks and reset attacks. Then we propose an extremely simple identification protocol and prove that its CR2 security is equivalent to the hardness of the Strong Diffie–Hellman problem.