Acta Metallurgica Sinica(English letters) ›› 2009, Vol. 16 ›› Issue (1): 76-80.doi: 10.1016/S1005-8885(08)60182-X

• Wireless • Previous Articles     Next Articles

Efficient and provably secure identification scheme without random oracles

LI Yan-ping, WANG Yu-min   

  1. State Key Laboratory of Integrated Service Network, Xidian University, Xi’an 710071, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-02-26
  • Contact: LI Yan-ping


The research on the identification scheme is an important and active area in computer and communication security. A series of identification schemes were proposed to improve the efficiency and security of the protocols by various methods. Based on the hardness assumption of the discrete logarithm problem in a gap Diffie-Hellman group and the difficulty of the collusion attack algorithm with k traitors, an efficient identification scheme is presented. Without random oracle models, the proposed scheme is then proved secure against impersonation and reset attacks in both concurrent and reset attack setting. Since the proposed scheme is simple, memory-saving, computation-efficient, and perfectly-secure, it is well suitable for use in smart cards.

Key words:

identification schemes;RSA problem;bilinear pairing;random oracle model