InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000378

Hierarchical combination of intruder theories

Identifieur interne : 000378 ( PascalFrancis/Checkpoint ); précédent : 000377; suivant : 000379

Hierarchical combination of intruder theories

Auteurs : Yannick Chevalier [France] ; Michaël Rusinowitch [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2006.

RBID : Pascal:07-0517948

Descripteurs français

Pascal (Inist)
- Réécriture, Démonstration automatique, Cryptanalyse, Théorie équationnelle, Décidabilité, Intrus, Groupe abélien, Modélisation, Exponentiation.

English descriptors

KwdEn :
- Abelian group, Automatic proving, Cryptanalysis, Decidability, Equational theory, Exponentiation, Intruder, Modeling, Rewriting.

Abstract

Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weaknesses, by a more accurate modelling of operators employed by protocols. Several works have shown how to handle a single algebraic operator (associated with a fixed intruder theory) or how to combine several operators satisfying disjoint theories. However several interesting equational theories, such as exponentiation with an abelian group law for exponents remain out of the scope of these techniques. This has motivated us to introduce a new notion of hierarchical combination for intruder theories and to show decidability results for the deduction problem in these theories. Under a simple hypothesis, we were able to simplify this deduction problem. This simplification is then applied to prove the decidability of constraint systems w.r.t. an intruder relying on exponentiation theory.

Affiliations:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000390
to stream PascalFrancis, to step Curation: 000643

Links to Exploration step

Pascal:07-0517948

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Hierarchical combination of intruder theories</title>
<author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>IRIT Université Paul Sabatier</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><settlement type="city">Toulouse</settlement>
<region type="region" nuts="2">Occitanie (région administrative)</region>
<region type="old region" nuts="2">Midi-Pyrénées</region>
</placeName>
<orgName type="university">Université Toulouse III - Paul Sabatier</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Toulouse</orgName>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA-INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA-INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0517948</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0517948 INIST</idno>
<idno type="RBID">Pascal:07-0517948</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000390</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000643</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000378</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000378</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Hierarchical combination of intruder theories</title>
<author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>IRIT Université Paul Sabatier</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><settlement type="city">Toulouse</settlement>
<region type="region" nuts="2">Occitanie (région administrative)</region>
<region type="old region" nuts="2">Midi-Pyrénées</region>
</placeName>
<orgName type="university">Université Toulouse III - Paul Sabatier</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Toulouse</orgName>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA-INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA-INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abelian group</term>
<term>Automatic proving</term>
<term>Cryptanalysis</term>
<term>Decidability</term>
<term>Equational theory</term>
<term>Exponentiation</term>
<term>Intruder</term>
<term>Modeling</term>
<term>Rewriting</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Réécriture</term>
<term>Démonstration automatique</term>
<term>Cryptanalyse</term>
<term>Théorie équationnelle</term>
<term>Décidabilité</term>
<term>Intrus</term>
<term>Groupe abélien</term>
<term>Modélisation</term>
<term>Exponentiation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weaknesses, by a more accurate modelling of operators employed by protocols. Several works have shown how to handle a single algebraic operator (associated with a fixed intruder theory) or how to combine several operators satisfying disjoint theories. However several interesting equational theories, such as exponentiation with an abelian group law for exponents remain out of the scope of these techniques. This has motivated us to introduce a new notion of hierarchical combination for intruder theories and to show decidability results for the deduction problem in these theories. Under a simple hypothesis, we were able to simplify this deduction problem. This simplification is then applied to prove the decidability of constraint systems w.r.t. an intruder relying on exponentiation theory.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>4098</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Hierarchical combination of intruder theories</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Term rewriting and applications : 17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>CHEVALIER (Yannick)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RUSINOWITCH (Michaël)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PFENNING (Frank)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>IRIT Université Paul Sabatier</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA-INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>108-122</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-36834-5</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000153621310090</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>26 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>07-0517948</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weaknesses, by a more accurate modelling of operators employed by protocols. Several works have shown how to handle a single algebraic operator (associated with a fixed intruder theory) or how to combine several operators satisfying disjoint theories. However several interesting equational theories, such as exponentiation with an abelian group law for exponents remain out of the scope of these techniques. This has motivated us to introduce a new notion of hierarchical combination for intruder theories and to show decidability results for the deduction problem in these theories. Under a simple hypothesis, we were able to simplify this deduction problem. This simplification is then applied to prove the decidability of constraint systems w.r.t. an intruder relying on exponentiation theory.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B07C</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D04A04E</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Cryptanalyse</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Cryptanalysis</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Criptoanálisis</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Decidability</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Intrus</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Intruder</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Intruso</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Groupe abélien</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Abelian group</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Grupo abeliano</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Modeling</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Modelización</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Exponentiation</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Exponentiation</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Expositoración</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>337</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Conference on Rewriting Techniques and Applications</s1>
<s2>17</s2>
<s3>Seattle WA USA</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
</country>
<region><li>Midi-Pyrénées</li>
<li>Occitanie (région administrative)</li>
</region>
<settlement><li>Toulouse</li>
</settlement>
<orgName><li>Université Toulouse III - Paul Sabatier</li>
<li>Université de Toulouse</li>
</orgName>
</list>
<tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name>
</region>
<name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000378 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000378 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:07-0517948
   |texte=   Hierarchical combination of intruder theories
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Hierarchical combination of intruder theories

Hierarchical combination of intruder theories

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri