Date Added: Feb 2012
The well-known forking lemma by Pointcheval and Stern has been used to prove the security of the so-called generic signature schemes. These signature schemes are obtained via the Fiat-Shamir transform from three-pass identification schemes. A number of five-pass identification protocols have been proposed in the last few years. Extending the forking lemma and the Fiat-Shamir transform would allow to obtain new signature schemes since, unfortunately, these newly proposed schemes fall outside the original framework. In this paper, the authors provide an extension of the forking lemma in order to assess the security of what they call n-generic signature schemes. These include signature schemes that are derived from certain (2n + 1)-pass identification schemes.