Contributions to the automatic verification of group protocols.
Identifieur interne : 001912 ( Hal/Curation ); précédent : 001911; suivant : 001913Contributions to the automatic verification of group protocols.
Auteurs : Najah Chridi [France]Source :
Descripteurs français
- mix :
English descriptors
- mix :
Abstract
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroeder, very few address the class of group protocols whose main characteristics are : the specific security properties that
they must satisfy, and the arbitrary number of participants they imply.
This thesis provides two main contributions. The first one deals with the first characteristic of group protocols. For that, we defined a model called the services model which we used to propose a strategy for flaws detection based on constraints solving. The suggested approach allows us to find known attacks and new ones on some group protocols. Some attacks have been also generalized to cover the case of n participants. The second main contribution of
this thesis consists in defining a synchronous model, that eneralizes standard protocol models by permitting unbounded lists inside messages. This is ensured by the introduction of a new operator called mpair which represents a list built on the same pattern. In this extended model, we have proposed a decision procedure for a particular class of group protocols called the class of well-tagged protocols with autonomous keys, in presence of an active intruder and with composed keys.
they must satisfy, and the arbitrary number of participants they imply.
This thesis provides two main contributions. The first one deals with the first characteristic of group protocols. For that, we defined a model called the services model which we used to propose a strategy for flaws detection based on constraints solving. The suggested approach allows us to find known attacks and new ones on some group protocols. Some attacks have been also generalized to cover the case of n participants. The second main contribution of
this thesis consists in defining a synchronous model, that eneralizes standard protocol models by permitting unbounded lists inside messages. This is ensured by the introduction of a new operator called mpair which represents a list built on the same pattern. In this extended model, we have proposed a decision procedure for a particular class of group protocols called the class of well-tagged protocols with autonomous keys, in presence of an active intruder and with composed keys.
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001912
Links to Exploration step
Hal:tel-00417290Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Contributions to the automatic verification of group protocols.</title><title xml:lang="fr">Contributions à la vérification automatique de protocoles de groupes.</title><author><name sortKey="Chridi, Najah" sort="Chridi, Najah" uniqKey="Chridi N" first="Najah" last="Chridi">Najah Chridi</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2366" status="OLD"><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-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></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><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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-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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></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><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">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></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:tel-00417290</idno><idno type="halId">tel-00417290</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-00417290</idno><idno type="url">https://tel.archives-ouvertes.fr/tel-00417290</idno><date when="2009-09-11">2009-09-11</date><idno type="wicri:Area/Hal/Corpus">001912</idno><idno type="wicri:Area/Hal/Curation">001912</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Contributions to the automatic verification of group protocols.</title><title xml:lang="fr">Contributions à la vérification automatique de protocoles de groupes.</title><author><name sortKey="Chridi, Najah" sort="Chridi, Najah" uniqKey="Chridi N" first="Najah" last="Chridi">Najah Chridi</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2366" status="OLD"><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-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></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><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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-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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></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><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</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/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">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></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>attack</term><term>autonomous keys</term><term>decidability</term><term>group protocol</term><term>parameterized lists</term><term>security property</term><term>services model.</term><term>synchronous model</term><term>well-tagged protocol</term></keywords><keywords scheme="mix" xml:lang="fr"><term>attaque</term><term>clefs autonomes</term><term>décidabilité</term><term>listes paramétrées</term><term>modèle de services</term><term>modèle de services.</term><term>modèle synchrone</term><term>propriété de sécurité</term><term>protocole bien-tagué</term><term>protocole de groupe</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroeder, very few address the class of group protocols whose main characteristics are : the specific security properties that
they must satisfy, and the arbitrary number of participants they imply.
This thesis provides two main contributions. The first one deals with the first characteristic of group protocols. For that, we defined a model called the services model which we used to propose a strategy for flaws detection based on constraints solving. The suggested approach allows us to find known attacks and new ones on some group protocols. Some attacks have been also generalized to cover the case of n participants. The second main contribution of
this thesis consists in defining a synchronous model, that eneralizes standard protocol models by permitting unbounded lists inside messages. This is ensured by the introduction of a new operator called mpair which represents a list built on the same pattern. In this extended model, we have proposed a decision procedure for a particular class of group protocols called the class of well-tagged protocols with autonomous keys, in presence of an active intruder and with composed keys.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Contributions to the automatic verification of group protocols.</title><title xml:lang="fr">Contributions à la vérification automatique de protocoles de groupes.</title><author role="aut"><persName><forename type="first">Najah</forename><surname>Chridi</surname></persName><email>najah.chridi@loria.fr</email><idno type="halauthor">65386</idno><affiliation ref="#struct-2366"></affiliation></author><editor role="depositor"><persName><forename>Najah</forename><surname>Chridi</surname></persName><email>chridi@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2009-09-15 15:31:07</date><date type="whenModified">2016-05-18 08:57:45</date><date type="whenReleased">2009-09-15 15:51:07</date><date type="whenProduced">2009-09-11</date><date type="whenEndEmbargoed">2009-09-15</date><ref type="file" target="https://tel.archives-ouvertes.fr/tel-00417290/document"><date notBefore="2009-09-15"></date></ref><ref type="file" n="1" target="https://tel.archives-ouvertes.fr/tel-00417290/file/Chridi-Najah-Thesis-09.pdf"><date notBefore="2009-09-15"></date></ref><ref type="annex" subtype="other" n="0" target="https://tel.archives-ouvertes.fr/tel-00417290/file/PhD-Chridi-Slides.pdf"><date notBefore="2009-09-15"></date></ref></edition><respStmt><resp>contributor</resp><name key="143707"><persName><forename>Najah</forename><surname>Chridi</surname></persName><email>chridi@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">tel-00417290</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-00417290</idno><idno type="halBibtex">chridi:tel-00417290</idno><idno type="halRefHtml">Autre [cs.OH]. Université Henri Poincaré - Nancy I, 2009. Français</idno><idno type="halRef">Autre [cs.OH]. Université Henri Poincaré - Nancy I, 2009. Français</idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="UNIV-FCOMTE">Université de Franche-Comté</idno><idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno><idno type="stamp" n="INRIA2">INRIA 2</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno><idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno><idno type="stamp" n="UNIV-BM">Université de Technologie de Belfort-Montbeliard</idno><idno type="stamp" n="ENSMM">Ecole Nationale Supérieure de Mécanique et des Microtechniques</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="UNIV-LORRAINE">Université de Lorraine</idno></seriesStmt><notesStmt></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Contributions to the automatic verification of group protocols.</title><title xml:lang="fr">Contributions à la vérification automatique de protocoles de groupes.</title><author role="aut"><persName><forename type="first">Najah</forename><surname>Chridi</surname></persName><email>najah.chridi@loria.fr</email><idno type="halAuthorId">65386</idno><affiliation ref="#struct-2366"></affiliation></author></analytic><monogr><imprint><date type="dateDefended">2009-09-11</date></imprint><authority type="institution">Université Henri Poincaré - Nancy I</authority><authority type="school">école doctorale IAEM Lorraine</authority><authority type="supervisor">Laurent Vigneron, Michael Rusinowitch(vigneron@loria.fr, rusi@loria.fr)</authority><authority type="jury">Maryline MAKNAVICUS-LAURENT (rapporteur)</authority><authority type="jury">Ralf TREINEN (rapporteur)</authority><authority type="jury">Sjouke MAUW (examinateur)</authority><authority type="jury">Refik MOLVA (examinateur)</authority><authority type="jury">Isabelle CHRISMENT (examinateur)</authority><authority type="jury">Laurent Vigneron (directeur)</authority><authority type="jury">Michaël RUSINOWITCH (directeur)</authority><authority type="jury">Mathieu TURUANI (examinateur)</authority></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="fr">French</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">group protocol</term><term xml:lang="en">parameterized lists</term><term xml:lang="en">well-tagged protocol</term><term xml:lang="en">security property</term><term xml:lang="en">attack</term><term xml:lang="en">decidability</term><term xml:lang="en">autonomous keys</term><term xml:lang="en">synchronous model</term><term xml:lang="en">services model.</term><term xml:lang="fr">modèle de services</term><term xml:lang="fr">protocole de groupe</term><term xml:lang="fr">listes paramétrées</term><term xml:lang="fr">protocole bien-tagué</term><term xml:lang="fr">propriété de sécurité</term><term xml:lang="fr">attaque</term><term xml:lang="fr">décidabilité</term><term xml:lang="fr">clefs autonomes</term><term xml:lang="fr">modèle synchrone</term><term xml:lang="fr">modèle de services.</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halDomain" n="info.info-mo">Computer Science [cs]/Modeling and Simulation</classCode><classCode scheme="halTypology" n="THESE">Theses</classCode></textClass><abstract xml:lang="en">Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroeder, very few address the class of group protocols whose main characteristics are : the specific security properties that
they must satisfy, and the arbitrary number of participants they imply.
This thesis provides two main contributions. The first one deals with the first characteristic of group protocols. For that, we defined a model called the services model which we used to propose a strategy for flaws detection based on constraints solving. The suggested approach allows us to find known attacks and new ones on some group protocols. Some attacks have been also generalized to cover the case of n participants. The second main contribution of
this thesis consists in defining a synchronous model, that eneralizes standard protocol models by permitting unbounded lists inside messages. This is ensured by the introduction of a new operator called mpair which represents a list built on the same pattern. In this extended model, we have proposed a decision procedure for a particular class of group protocols called the class of well-tagged protocols with autonomous keys, in presence of an active intruder and with composed keys.</abstract><abstract xml:lang="fr">Les protocoles cryptographiques sont cruciaux pour sécuriser les transactions électroniques. La confiance en ces protocoles peut être augmentée par l'analyse formelle de leurs propriétés de sécurité.
Bien que beaucoup de travaux aient été dédiés pour les protocoles classiques comme le protocole de Needham-Schroeder, très peu de travaux s'adressent à la classe des protocoles de groupe dont les caractéristiques principales sont : les propriétés de sécurité spécifiques qu'ils doivent satisfaire, et le nombre arbitraire des participants qu'ils impliquent.
Cette thèse comprend deux contributions principales. La première traite la première caractéristique des protocoles de groupe.
Pour cela, nous avons défini un modèle appelé modèle de services que nous avons utilisé pour proposer une stratégie de recherche d'attaques se basant sur la résolution de contraintes. L'approche proposée a permis de retrouver d'anciennes attaques et d'en découvrir de nouvelles sur quelques protocoles de groupe. Certaines attaques ont aussi pu être généralisées pour couvrir le cas de $n$ participants. La deuxième contribution principale de cette thèse consiste à définir un modèle synchrone qui généralise les modèles standards de protocoles en permettant les listes non bornées à l'intérieur des messages. Ceci est assuré par l'introduction d'un nouvel opérateur appelé $mpair$ qui représente une liste construite sur un même patron. Dans ce modèle étendu, nous avons proposé une procédure de décision pour une classe particulière des protocoles de groupe appelée classe de protocoles bien-tagués avec clefs autonomes, en présence d'un intrus actif et avec des clefs composées.</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 001912 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 001912 | 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:tel-00417290
|texte= Contributions to the automatic verification of group protocols.
}}
| This area was generated with Dilib version V0.6.33. |  |