Paper 2007/049

Security Arguments for a Class of ID-based Signatures

jin zhou, ya-juan zhang, and yue-fei zhu


Provable security based on complexity theory provides an efficient way for providing the convincing evidences of security. In this paper, we present a definition of generic ID-based signature schemes (GIBSS) by extending the definition of generic signature schemes, and prove the Forking lemma for GIBSS. That is, we provide the Forking lemma for ID-based signature schemes. The theoretical result can be viewed as an extension of the Forking Lemma due to Pointcheval and Stern for ID-based signature schemes, and can help to understand and simplify the security proofs. Then we propose a new and efficient ID-based signature scheme built upon bilinear maps. We prove its security under k-CAA computational assumption in the random oracle model.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
zhoujin820916 jojo @ yahoo com cn
2007-02-20: received
Short URL
Creative Commons Attribution


      author = {jin zhou and ya-juan zhang and yue-fei zhu},
      title = {Security Arguments for a Class of ID-based Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2007/049},
      year = {2007},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.