Cryptology ePrint Archive: Report 2007/049

Security Arguments for a Class of ID-based Signatures

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

Abstract: 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.

Category / Keywords: public-key cryptography /

Date: received 12 Feb 2007

Contact author: zhoujin820916 jojo at yahoo com cn

Available format(s): PDF | BibTeX Citation

Version: 20070220:100312 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]