Combining intruder theories
Identifieur interne : 006648 ( Main/Merge ); précédent : 006647; suivant : 006649Combining intruder theories
Auteurs : Yannick Chevalier [France] ; Michaël Rusinowitch [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Cryptographie.
English descriptors
- KwdEn :
Abstract
Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples of such sets of operators comprise XOR, multiplication/exponentiation, abstract encryption/decryption. In this paper we give an algorithm for combining decision procedures for arbitrary intruder theories with disjoint sets of operators, provided that solvability of ordered intruder constraints, a slight generalization of intruder constraints, can be decided in each theory. This is the case for most of the intruder theories for which a decision procedure has been given. In particular our result allows us to decide trace-based security properties of protocols that employ any combination of the above mentioned operators with a bounded number of sessions.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000547
- to stream PascalFrancis, to step Curation: 000491
- to stream PascalFrancis, to step Checkpoint: 000511
Links to Exploration step
Pascal:05-0336972Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Combining 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">05-0336972</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 05-0336972 INIST</idno><idno type="RBID">Pascal:05-0336972</idno><idno type="wicri:Area/PascalFrancis/Corpus">000547</idno><idno type="wicri:Area/PascalFrancis/Curation">000491</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000511</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000511</idno><idno type="wicri:doubleKey">0302-9743:2005:Chevalier Y:combining:intruder:theories</idno><idno type="wicri:Area/Main/Merge">006648</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Combining 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="2005">2005</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>Automaton</term><term>Bounded operator</term><term>Cryptography</term><term>Decision analysis</term><term>Decision theory</term><term>Decryption</term><term>Encryption</term><term>Exponentiation</term><term>Intruder</term><term>Safety</term><term>Set theory</term><term>Solvability</term><term>Symbolic analysis</term><term>Transmission protocol</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Analyse symbolique</term><term>Cryptage</term><term>Cryptographie</term><term>Décryptage</term><term>Théorie décision</term><term>Protocole transmission</term><term>Sécurité</term><term>Intrus</term><term>Analyse décision</term><term>Théorie ensemble</term><term>Résolubilité</term><term>Opérateur borné</term><term>Automate</term><term>.</term><term>Exponentiation</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples of such sets of operators comprise XOR, multiplication/exponentiation, abstract encryption/decryption. In this paper we give an algorithm for combining decision procedures for arbitrary intruder theories with disjoint sets of operators, provided that solvability of ordered intruder constraints, a slight generalization of intruder constraints, can be decided in each theory. This is the case for most of the intruder theories for which a decision procedure has been given. In particular our result allows us to decide trace-based security properties of protocols that employ any combination of the above mentioned operators with a bounded number of sessions.</div></front></TEI><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/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006648 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006648 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= Pascal:05-0336972
|texte= Combining intruder theories
}}
| This area was generated with Dilib version V0.6.33. |  |