Extended security arguments for signature schemes
Identifieur interne : 002155 ( Hal/Curation ); précédent : 002154; suivant : 002156Extended security arguments for signature schemes
Auteurs : Özgür Dagdelen [Allemagne] ; David Galindo [France] ; Pascal Véron [France] ; Sidi Mohamed El Yousfi Alaoui [Allemagne] ; Pierre-Louis Cayrel [Allemagne]Source :
- Designs, Codes and Cryptography [ 0925-1022 ] ; 2016-02.
Abstract
It is known how to transform certain canonical three-pass identification schemes into signature schemes via the Fiat–Shamir transform. Pointcheval and Stern showed that those schemes are existentially unforgeable in the random-oracle model leveraging the, at that time, novel forking lemma. Recently, a number of 5-pass identification protocols have been proposed. Extending the above technique to capture 5-pass identification schemes would allow to obtain novel unforgeable signature schemes. In this paper, we provide an extension of the forking lemma (and the Fiat–Shamir transform) 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. In doing so, we put forward a generic methodology for proving the security of a number of signature schemes derived from (2n+1)-pass identification schemes for n≥2. As an application of this methodology, we obtain two new code-based existentially-unforgeable signature schemes, along with a security reduction. In particular, we solve an open problem in multivariate cryptography posed by Sakumoto, Shirai and Hiwatari at CRYPTO 2011.
Url:
DOI: 10.1007/s10623-014-0009-7
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002155
Links to Exploration step
Hal:hal-01313619Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Extended security arguments for signature schemes</title><author><name sortKey="Dagdelen, Ozgur" sort="Dagdelen, Ozgur" uniqKey="Dagdelen O" first="Özgür" last="Dagdelen">Özgür Dagdelen</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Galindo, David" sort="Galindo, David" uniqKey="Galindo D" first="David" last="Galindo">David Galindo</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-189789" status="VALID"><idno type="RNSR">200318302K</idno><orgName>Combination of approaches to the security of infinite states systems</orgName><orgName type="acronym">CASSIS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/cassis</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-866" type="direct"></relation><relation active="#struct-242365" type="indirect"></relation><relation active="#struct-300261" type="indirect"></relation><relation active="#struct-300360" type="indirect"></relation><relation name="UMR6174" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-866" type="direct"><org type="laboratory" xml:id="struct-866" status="VALID"><idno type="IdRef">152639071</idno><idno type="RNSR">200412232H</idno><orgName>Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies</orgName><orgName type="acronym">FEMTO-ST</orgName><desc><address><addrLine>32 avenue de l'Observatoire 25044 BESANCON CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://www.femto-st.fr</ref></desc><listRelation><relation active="#struct-242365" type="direct"></relation><relation active="#struct-300261" type="direct"></relation><relation active="#struct-300360" type="direct"></relation><relation name="UMR6174" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-242365" type="indirect"><org type="institution" xml:id="struct-242365" status="VALID"><idno type="IdRef">026403188</idno><idno type="ISNI">0000 0001 2188 3779 </idno><orgName>Université de Franche-Comté</orgName><orgName type="acronym">UFC</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.univ-fcomte.fr</ref></desc></org></tutelle><tutelle active="#struct-300261" type="indirect"><org type="institution" xml:id="struct-300261" status="VALID"><orgName>Université de Technologie de Belfort-Montbeliard</orgName><orgName type="acronym">UTBM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300360" type="indirect"><org type="institution" xml:id="struct-300360" status="VALID"><orgName>Ecole Nationale Supérieure de Mécanique et des Microtechniques</orgName><orgName type="acronym">ENSMM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle name="UMR6174" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city" wicri:auto="siege">Besançon</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de Franche-Comté</orgName><orgName type="institution" wicri:auto="newGroup">Université de Bourgogne Franche-Comté</orgName><placeName><settlement type="city" wicri:auto="siege">Belfort</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de technologie de Belfort-Montbéliard</orgName></affiliation></author><author><name sortKey="Veron, Pascal" sort="Veron, Pascal" uniqKey="Veron P" first="Pascal" last="Véron">Pascal Véron</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-68760" status="VALID"><orgName>Institut de Mathématiques de Toulon</orgName><orgName type="acronym">IMATH</orgName><desc><address><addrLine>Université de Toulon - Bâtiment U - B.P. 20132 - 83957 La Garde Cedex</addrLine><country key="FR"></country></address><ref type="url">http://imath.fr</ref></desc><listRelation><relation name="EA2134" active="#struct-303091" type="direct"></relation></listRelation><tutelles><tutelle name="EA2134" active="#struct-303091" type="direct"><org type="institution" xml:id="struct-303091" status="VALID"><orgName>Université de Toulon</orgName><orgName type="acronym">UTLN</orgName><desc><address><addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-tln.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country></affiliation></author><author><name sortKey="El Yousfi Alaoui, Sidi Mohamed" sort="El Yousfi Alaoui, Sidi Mohamed" uniqKey="El Yousfi Alaoui S" first="Sidi Mohamed" last="El Yousfi Alaoui">Sidi Mohamed El Yousfi Alaoui</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Cayrel, Pierre Louis" sort="Cayrel, Pierre Louis" uniqKey="Cayrel P" first="Pierre-Louis" last="Cayrel">Pierre-Louis Cayrel</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-01313619</idno><idno type="halId">hal-01313619</idno><idno type="halUri">https://hal.inria.fr/hal-01313619</idno><idno type="url">https://hal.inria.fr/hal-01313619</idno><idno type="doi">10.1007/s10623-014-0009-7</idno><date when="2016-02">2016-02</date><idno type="wicri:Area/Hal/Corpus">002155</idno><idno type="wicri:Area/Hal/Curation">002155</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Extended security arguments for signature schemes</title><author><name sortKey="Dagdelen, Ozgur" sort="Dagdelen, Ozgur" uniqKey="Dagdelen O" first="Özgür" last="Dagdelen">Özgür Dagdelen</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Galindo, David" sort="Galindo, David" uniqKey="Galindo D" first="David" last="Galindo">David Galindo</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-189789" status="VALID"><idno type="RNSR">200318302K</idno><orgName>Combination of approaches to the security of infinite states systems</orgName><orgName type="acronym">CASSIS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/cassis</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-866" type="direct"></relation><relation active="#struct-242365" type="indirect"></relation><relation active="#struct-300261" type="indirect"></relation><relation active="#struct-300360" type="indirect"></relation><relation name="UMR6174" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-866" type="direct"><org type="laboratory" xml:id="struct-866" status="VALID"><idno type="IdRef">152639071</idno><idno type="RNSR">200412232H</idno><orgName>Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies</orgName><orgName type="acronym">FEMTO-ST</orgName><desc><address><addrLine>32 avenue de l'Observatoire 25044 BESANCON CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://www.femto-st.fr</ref></desc><listRelation><relation active="#struct-242365" type="direct"></relation><relation active="#struct-300261" type="direct"></relation><relation active="#struct-300360" type="direct"></relation><relation name="UMR6174" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-242365" type="indirect"><org type="institution" xml:id="struct-242365" status="VALID"><idno type="IdRef">026403188</idno><idno type="ISNI">0000 0001 2188 3779 </idno><orgName>Université de Franche-Comté</orgName><orgName type="acronym">UFC</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.univ-fcomte.fr</ref></desc></org></tutelle><tutelle active="#struct-300261" type="indirect"><org type="institution" xml:id="struct-300261" status="VALID"><orgName>Université de Technologie de Belfort-Montbeliard</orgName><orgName type="acronym">UTBM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300360" type="indirect"><org type="institution" xml:id="struct-300360" status="VALID"><orgName>Ecole Nationale Supérieure de Mécanique et des Microtechniques</orgName><orgName type="acronym">ENSMM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle name="UMR6174" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city" wicri:auto="siege">Besançon</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de Franche-Comté</orgName><orgName type="institution" wicri:auto="newGroup">Université de Bourgogne Franche-Comté</orgName><placeName><settlement type="city" wicri:auto="siege">Belfort</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de technologie de Belfort-Montbéliard</orgName></affiliation></author><author><name sortKey="Veron, Pascal" sort="Veron, Pascal" uniqKey="Veron P" first="Pascal" last="Véron">Pascal Véron</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-68760" status="VALID"><orgName>Institut de Mathématiques de Toulon</orgName><orgName type="acronym">IMATH</orgName><desc><address><addrLine>Université de Toulon - Bâtiment U - B.P. 20132 - 83957 La Garde Cedex</addrLine><country key="FR"></country></address><ref type="url">http://imath.fr</ref></desc><listRelation><relation name="EA2134" active="#struct-303091" type="direct"></relation></listRelation><tutelles><tutelle name="EA2134" active="#struct-303091" type="direct"><org type="institution" xml:id="struct-303091" status="VALID"><orgName>Université de Toulon</orgName><orgName type="acronym">UTLN</orgName><desc><address><addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-tln.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country></affiliation></author><author><name sortKey="El Yousfi Alaoui, Sidi Mohamed" sort="El Yousfi Alaoui, Sidi Mohamed" uniqKey="El Yousfi Alaoui S" first="Sidi Mohamed" last="El Yousfi Alaoui">Sidi Mohamed El Yousfi Alaoui</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Cayrel, Pierre Louis" sort="Cayrel, Pierre Louis" uniqKey="Cayrel P" first="Pierre-Louis" last="Cayrel">Pierre-Louis Cayrel</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-161409" status="VALID"><orgName>Center for Advanced Security Research Darmstadt [Darmstadt]</orgName><orgName type="acronym">CASED</orgName><desc><address><addrLine>32 Mornewegstrasse, 64293 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.cased.de/</ref></desc><listRelation><relation active="#struct-300723" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300723" type="direct"><org type="institution" xml:id="struct-300723" status="VALID"><orgName>Technische Universität Darmstadt [Darmstadt]</orgName><desc><address><addrLine>Franziska-Braun-Straße 3, 64287 Darmstadt</addrLine><country key="DE"></country></address><ref type="url">http://www.tu-darmstadt.de/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author></analytic><idno type="DOI">10.1007/s10623-014-0009-7</idno><series><title level="j">Designs, Codes and Cryptography</title><idno type="ISSN">0925-1022</idno><imprint><date type="datePub">2016-02</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">It is known how to transform certain canonical three-pass identification schemes into signature schemes via the Fiat–Shamir transform. Pointcheval and Stern showed that those schemes are existentially unforgeable in the random-oracle model leveraging the, at that time, novel forking lemma. Recently, a number of 5-pass identification protocols have been proposed. Extending the above technique to capture 5-pass identification schemes would allow to obtain novel unforgeable signature schemes. In this paper, we provide an extension of the forking lemma (and the Fiat–Shamir transform) 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. In doing so, we put forward a generic methodology for proving the security of a number of signature schemes derived from (2n+1)-pass identification schemes for n≥2. As an application of this methodology, we obtain two new code-based existentially-unforgeable signature schemes, along with a security reduction. In particular, we solve an open problem in multivariate cryptography posed by Sakumoto, Shirai and Hiwatari at CRYPTO 2011.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Extended security arguments for signature schemes</title><author role="aut"><persName><forename type="first">Özgür</forename><surname>Dagdelen</surname></persName><email></email><idno type="halauthor">709584</idno><affiliation ref="#struct-161409"></affiliation></author><author role="aut"><persName><forename type="first">David</forename><surname>Galindo</surname></persName><email></email><idno type="halauthor">709585</idno><affiliation ref="#struct-189789"></affiliation></author><author role="aut"><persName><forename type="first">Pascal</forename><surname>Véron</surname></persName><email>veron@univ-tln.fr</email><ptr type="url" target="http://veron.univ-tln.fr"></ptr><idno type="idhal">pascal-veron</idno><idno type="halauthor">697252</idno><affiliation ref="#struct-68760"></affiliation></author><author role="aut"><persName><forename type="first">Sidi Mohamed</forename><surname>El Yousfi Alaoui</surname></persName><email></email><idno type="halauthor">686790</idno><affiliation ref="#struct-161409"></affiliation></author><author role="aut"><persName><forename type="first">Pierre-Louis</forename><surname>Cayrel</surname></persName><email></email><idno type="halauthor">291985</idno><affiliation ref="#struct-161409"></affiliation></author><editor role="depositor"><persName><forename>Pascal</forename><surname>Véron</surname></persName><email>veron@univ-tln.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2016-05-10 11:03:18</date><date type="whenModified">2016-05-13 11:42:48</date><date type="whenReleased">2016-05-10 11:03:18</date><date type="whenProduced">2016-02</date></edition><respStmt><resp>contributor</resp><name key="170454"><persName><forename>Pascal</forename><surname>Véron</surname></persName><email>veron@univ-tln.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">hal-01313619</idno><idno type="halUri">https://hal.inria.fr/hal-01313619</idno><idno type="halBibtex">dagdelen:hal-01313619</idno><idno type="halRefHtml">Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (2), pp.441-461. <10.1007/s10623-014-0009-7></idno><idno type="halRef">Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (2), pp.441-461. <10.1007/s10623-014-0009-7></idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="UNIV-FCOMTE">Université de Franche-Comté</idno><idno type="stamp" n="UNIV-BM">Université de Technologie de Belfort-Montbeliard</idno><idno type="stamp" n="UNIV-TLN">Université de Toulon</idno><idno type="stamp" n="ENSMM">Ecole Nationale Supérieure de Mécanique et des Microtechniques</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno><idno type="stamp" n="FEMTO-ST" p="UNIV-FCOMTE">Franche-Comté Electronique, Mécanique, Thermique et Optique - Sciences et Technologies</idno><idno type="stamp" n="UNIV-BM-THESE">Université de Technologie de Belfort-Montbeliard</idno><idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="INRIA2">INRIA 2</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="IMATH" p="UNIV-TLN">Institut de mathématiques de Toulon</idno><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno></seriesStmt><notesStmt><note type="audience" n="2">International</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Extended security arguments for signature schemes</title><author role="aut"><persName><forename type="first">Özgür</forename><surname>Dagdelen</surname></persName><idno type="halAuthorId">709584</idno><affiliation ref="#struct-161409"></affiliation></author><author role="aut"><persName><forename type="first">David</forename><surname>Galindo</surname></persName><idno type="halAuthorId">709585</idno><affiliation ref="#struct-189789"></affiliation></author><author role="aut"><persName><forename type="first">Pascal</forename><surname>Véron</surname></persName><email>veron@univ-tln.fr</email><ptr type="url" target="http://veron.univ-tln.fr"></ptr><idno type="idHal">pascal-veron</idno><idno type="halAuthorId">697252</idno><affiliation ref="#struct-68760"></affiliation></author><author role="aut"><persName><forename type="first">Sidi Mohamed</forename><surname>El Yousfi Alaoui</surname></persName><idno type="halAuthorId">686790</idno><affiliation ref="#struct-161409"></affiliation></author><author role="aut"><persName><forename type="first">Pierre-Louis</forename><surname>Cayrel</surname></persName><idno type="halAuthorId">291985</idno><affiliation ref="#struct-161409"></affiliation></author></analytic><monogr><idno type="halJournalId" status="VALID">12540</idno><idno type="issn">0925-1022</idno><idno type="eissn">1573-7586</idno><title level="j">Designs, Codes and Cryptography</title><imprint><publisher>Springer Verlag</publisher><biblScope unit="volume">78</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="pp">441-461</biblScope><date type="datePub">2016-02</date><date type="dateEpub">2014-09</date></imprint></monogr><idno type="doi">10.1007/s10623-014-0009-7</idno><relatedItem target="https://hal.inria.fr/hal-01091185" type="isFormatOf"></relatedItem></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode><classCode scheme="halTypology" n="ART">Journal articles</classCode></textClass><abstract xml:lang="en">It is known how to transform certain canonical three-pass identification schemes into signature schemes via the Fiat–Shamir transform. Pointcheval and Stern showed that those schemes are existentially unforgeable in the random-oracle model leveraging the, at that time, novel forking lemma. Recently, a number of 5-pass identification protocols have been proposed. Extending the above technique to capture 5-pass identification schemes would allow to obtain novel unforgeable signature schemes. In this paper, we provide an extension of the forking lemma (and the Fiat–Shamir transform) 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. In doing so, we put forward a generic methodology for proving the security of a number of signature schemes derived from (2n+1)-pass identification schemes for n≥2. As an application of this methodology, we obtain two new code-based existentially-unforgeable signature schemes, along with a security reduction. In particular, we solve an open problem in multivariate cryptography posed by Sakumoto, Shirai and Hiwatari at CRYPTO 2011.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002155 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 002155 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Curation
|type= RBID
|clé= Hal:hal-01313619
|texte= Extended security arguments for signature schemes
}}
| This area was generated with Dilib version V0.6.33. |  |