Skip to Main content Skip to Navigation
Conference papers

Extended Security Arguments for Signature Schemes

Abstract : 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 identifi- cation protocols have been proposed in the last few years. Extending the forking lemma and the Fiat-Shamir transform would allow to ob- tain new signature schemes since, unfortunately, these newly proposed schemes fall outside the original framework. In this paper, we provide an extension of the forking lemma in order to assess the security of what we call n-generic signature schemes. These include signature schemes that are derived from certain (2n + 1)-pass identification schemes. We thus obtain a generic methodology for proving the security of a number of signature schemes derived from recently published five-pass identifica- tion protocols, and potentially for (2n + 1)-pass identification schemes to come.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Pascal Véron <>
Submitted on : Wednesday, February 20, 2013 - 2:59:13 PM
Last modification on : Monday, January 13, 2020 - 5:46:04 PM
Long-term archiving on: : Tuesday, May 21, 2013 - 9:21:44 AM


Publisher files allowed on an open archive




Sidi Mohamed El Yousfi Alaoui, Özgür Dagdelen, Pascal Véron, David Galindo, Pierre-Louis Cayrel. Extended Security Arguments for Signature Schemes. Africacrypt 2012, Jul 2012, Ifrane, Morocco. pp.19-34, ⟨10.1007/978-3-642-31410-0_2⟩. ⟨hal-00684486⟩



Record views


Files downloads