Combining Intruder Theories
Identifieur interne : 006511 ( Main/Merge ); précédent : 006510; suivant : 006512Combining Intruder Theories
Auteurs : Yannick Chevalier [France] ; Michaël Rusinowitch [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
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.
Url:
DOI: 10.1007/11523468_52
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003597
- to stream Istex, to step Curation: 003555
- to stream Istex, to step Checkpoint: 001600
Links to Exploration step
ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Combining Intruder Theories</title><author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11523468_52</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-SJFXGRG6-G/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003597</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003597</idno><idno type="wicri:Area/Istex/Curation">003555</idno><idno type="wicri:Area/Istex/Checkpoint">001600</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001600</idno><idno type="wicri:doubleKey">0302-9743:2005:Chevalier Y:combining:intruder:theories</idno><idno type="wicri:Area/Main/Merge">006511</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">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="1"><country xml:lang="fr">France</country><wicri:regionArea>IRIT Université Paul Sabatier</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></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"><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INRIA-Lorraine</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI></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 006511 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006511 | 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é= ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4
|texte= Combining Intruder Theories
}}
| This area was generated with Dilib version V0.6.33. |  |