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 by extending the definition of generic signature schemes, and prove the Forking lemma for that. 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.
Index Terms:
ID-based signatures, Forking lemma, Provable security, Existential forgery
Citation:
Zhengwei Guo, Xinzheng He, Baocheng Xun, "Security Arguments for a Class of ID-Based Signatures," icds, pp.165-170, Second International Conference on the Digital Society, 2008