InforLorV4, Main, Curation, bibRecord, 006286

Combining Intruder Theories

Identifieur interne : 006286 ( Main/Curation ); précédent : 006285; suivant : 006287

Combining Intruder Theories

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

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4

Descripteurs français

Pascal (Inist)
- ., Analyse décision, Analyse symbolique, Automate, Cryptage, Cryptographie, Décryptage, Exponentiation, Intrus, Opérateur borné, Protocole transmission, Résolubilité, Sécurité, Théorie décision, Théorie ensemble.
Wicri :
- topic : Cryptographie.

English descriptors

KwdEn :
- Automaton, Bounded operator, Cryptography, Decision analysis, Decision theory, Decryption, Encryption, Exponentiation, Intruder, Safety, Set theory, Solvability, Symbolic analysis, Transmission protocol.

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:

https://api.istex.fr/ark:/67375/HCB-SJFXGRG6-G/fulltext.pdf

DOI: 10.1007/11523468_52

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

to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003597
to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :003555
to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001600
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :006511
to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000547
to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000491
to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000511
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :006648

Links to Exploration step

ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4

Le 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>
<idno type="wicri:source">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>
<idno type="wicri:Area/Main/Curation">006286</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><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>.</term>
<term>Analyse décision</term>
<term>Analyse symbolique</term>
<term>Automate</term>
<term>Cryptage</term>
<term>Cryptographie</term>
<term>Décryptage</term>
<term>Exponentiation</term>
<term>Intrus</term>
<term>Opérateur borné</term>
<term>Protocole transmission</term>
<term>Résolubilité</term>
<term>Sécurité</term>
<term>Théorie décision</term>
<term>Théorie ensemble</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term>
</keywords>
</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>
<double idat="0302-9743:2005:Chevalier Y:combining:intruder:theories"><INIST><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>
</INIST>
<ISTEX><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>
</ISTEX>
</double>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 006286 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Curation
   |type=    RBID
   |clé=     ISTEX:E1C21E2BA521EDEF4DA5A7DCC0EBFCD9167CFDA4
   |texte=   Combining 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

Combining Intruder Theories

Combining 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