InforLorV4, PascalFrancis, Corpus, bibRecord, 000719

Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions

Identifieur interne : 000719 ( PascalFrancis/Corpus ); précédent : 000718; suivant : 000720

Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions

Auteurs : Yannick Chevalier ; Ralf Küsters ; Michaël Rusinowitch ; Mathieu Turuani ; Laurent Vigneron

Source :

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

RBID : Pascal:04-0157709

Descripteurs français

Pascal (Inist)
- Cryptographie, Protocole transmission, Secret, Intrus.

English descriptors

KwdEn :
- Cryptography, Intruder, Secrecy, Transmission protocol.

Abstract

We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2803`
A08	`01`	`1`	`ENG`	`@1 Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions`
A09	`01`	`1`	`ENG`	`@1 Computer science logic : Vienna, 25-30 August 2003`
A11	`01`	`1`		`@1 CHEVALIER (Yannick)`
A11	`02`	`1`		`@1 KÜSTERS (Ralf)`
A11	`03`	`1`		`@1 RUSINOWITCH (Michaël)`
A11	`04`	`1`		`@1 TURUANI (Mathieu)`
A11	`05`	`1`		`@1 VIGNERON (Laurent)`
A12	`01`	`1`		`@1 BAAZ (Matthias) @9 ed.`
A12	`02`	`1`		`@1 MAKOWSKY (Johann A.) @9 ed.`
A14	`01`			`@1 LORIA-INRIA-Universités Henri Poincaré, Nancy 2 @2 54506 Vandoeuvre-les-Nancy @3 FRA @Z 1 aut. @Z 3 aut. @Z 4 aut. @Z 5 aut.`
A14	`02`			`@1 Department of Computer Science, Stanford University @2 Stanford CA 94305 @3 USA @Z 2 aut.`
A20				`@1 128-141`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40801-0`
A43	`01`			`@1 INIST @2 16343 @5 354000117780820130`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 19 ref.`
A47	`01`	`1`		`@0 04-0157709`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.`
C02	`01`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Cryptographie @5 01`
C03	`01`	`X`	`ENG`	`@0 Cryptography @5 01`
C03	`01`	`X`	`SPA`	`@0 Criptografía @5 01`
C03	`02`	`X`	`FRE`	`@0 Protocole transmission @5 02`
C03	`02`	`X`	`ENG`	`@0 Transmission protocol @5 02`
C03	`02`	`X`	`SPA`	`@0 Protocolo transmisión @5 02`
C03	`03`	`X`	`FRE`	`@0 Secret @5 11`
C03	`03`	`X`	`ENG`	`@0 Secrecy @5 11`
C03	`03`	`X`	`SPA`	`@0 Secreto @5 11`
C03	`04`	`X`	`FRE`	`@0 Intrus @5 12`
C03	`04`	`X`	`ENG`	`@0 Intruder @5 12`
C03	`04`	`X`	`SPA`	`@0 Intruso @5 12`
N21				`@1 103`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International workshop CSL 2003 @2 17 @3 Vienna AUT @4 2003-08-25`
A30	`02`	`1`	`ENG`	`@1 EACSL. Annual conference @2 12 @3 Vienna AUT @4 2003-08-25`
A30	`03`	`1`	`ENG`	`@1 KGC 2003 : Kurt Gödel colloquium @2 8 @3 Vienna AUT @4 2003-08-25`

Format Inist (serveur)

NO :	PASCAL 04-0157709 INIST
ET :	Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions
AU :	CHEVALIER (Yannick); KÜSTERS (Ralf); RUSINOWITCH (Michaël); TURUANI (Mathieu); VIGNERON (Laurent); BAAZ (Matthias); MAKOWSKY (Johann A.)
AF :	LORIA-INRIA-Universités Henri Poincaré, Nancy 2/54506 Vandoeuvre-les-Nancy/France (1 aut., 3 aut., 4 aut., 5 aut.); Department of Computer Science, Stanford University/Stanford CA 94305/Etats-Unis (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2803; Pp. 128-141; Bibl. 19 ref.
LA :	Anglais
EA :	We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.
CC :	001D02A04
FD :	Cryptographie; Protocole transmission; Secret; Intrus
ED :	Cryptography; Transmission protocol; Secrecy; Intruder
SD :	Criptografía; Protocolo transmisión; Secreto; Intruso
LO :	INIST-16343.354000117780820130
ID :	04-0157709

Links to Exploration step

Pascal:04-0157709

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions</title>
<author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Küsters">Ralf Küsters</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, Stanford University</s1>
<s2>Stanford CA 94305</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Vigneron, Laurent" sort="Vigneron, Laurent" uniqKey="Vigneron L" first="Laurent" last="Vigneron">Laurent Vigneron</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0157709</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0157709 INIST</idno>
<idno type="RBID">Pascal:04-0157709</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000719</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions</title>
<author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Küsters">Ralf Küsters</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, Stanford University</s1>
<s2>Stanford CA 94305</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Vigneron, Laurent" sort="Vigneron, Laurent" uniqKey="Vigneron L" first="Laurent" last="Vigneron">Laurent Vigneron</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</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>Cryptography</term>
<term>Intruder</term>
<term>Secrecy</term>
<term>Transmission protocol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Cryptographie</term>
<term>Protocole transmission</term>
<term>Secret</term>
<term>Intrus</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2803</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Computer science logic : Vienna, 25-30 August 2003</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>CHEVALIER (Yannick)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KÜSTERS (Ralf)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RUSINOWITCH (Michaël)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>TURUANI (Mathieu)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>VIGNERON (Laurent)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAAZ (Matthias)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MAKOWSKY (Johann A.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA-INRIA-Universités Henri Poincaré, Nancy 2</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Computer Science, Stanford University</s1>
<s2>Stanford CA 94305</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>128-141</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40801-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117780820130</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>19 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0157709</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>We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Cryptographie</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Cryptography</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Criptografía</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Protocole transmission</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Transmission protocol</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Protocolo transmisión</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Secret</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Secrecy</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Secreto</s0>
<s5>11</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Intrus</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Intruder</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Intruso</s0>
<s5>12</s5>
</fC03>
<fN21><s1>103</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International workshop CSL 2003</s1>
<s2>17</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG"><s1>EACSL. Annual conference</s1>
<s2>12</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
<fA30 i1="03" i2="1" l="ENG"><s1>KGC 2003 : Kurt Gödel colloquium</s1>
<s2>8</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0157709 INIST</NO>
<ET>Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions</ET>
<AU>CHEVALIER (Yannick); KÜSTERS (Ralf); RUSINOWITCH (Michaël); TURUANI (Mathieu); VIGNERON (Laurent); BAAZ (Matthias); MAKOWSKY (Johann A.)</AU>
<AF>LORIA-INRIA-Universités Henri Poincaré, Nancy 2/54506 Vandoeuvre-les-Nancy/France (1 aut., 3 aut., 4 aut., 5 aut.); Department of Computer Science, Stanford University/Stanford CA 94305/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2803; Pp. 128-141; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.</EA>
<CC>001D02A04</CC>
<FD>Cryptographie; Protocole transmission; Secret; Intrus</FD>
<ED>Cryptography; Transmission protocol; Secrecy; Intruder</ED>
<SD>Criptografía; Protocolo transmisión; Secreto; Intruso</SD>
<LO>INIST-16343.354000117780820130</LO>
<ID>04-0157709</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000719 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:04-0157709
   |texte=   Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions
}}

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

Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions

Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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