Generic ID-Based Signature Schemes and Forking Lemma
Yuefei Zhu · Journal of Information Engineering University · 2007
Evaluating the “security” is a sticking point for the construction of new cryptographic scheme.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.That is,we present security arguments for generic ID-based signature schemes in the random oracle.As an example,we show that Hess's scheme can be easily proved to be secure with the Forking lemma.