## CryptoDB

### Paper: Security Arguments for a Class of ID-based Signatures

Authors: jin zhou ya-juan zhang yue-fei zhu URL: http://eprint.iacr.org/2007/049 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13331,
title={Security Arguments for a Class of ID-based Signatures},
booktitle={IACR Eprint archive},
keywords={public-key cryptography /},
url={http://eprint.iacr.org/2007/049},
note={ zhoujin820916.jojo@yahoo.com.cn 13556 received 12 Feb 2007},
author={jin zhou and ya-juan zhang and yue-fei zhu},
year=2007
}