Recursion vs. Replication in Simple Cryptographic Protocols Hans H uttel Ji r ...  Home/Search
Context
Related
| brics.dk/RS/04/Ref...ICSRS0423.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/RS/04/...BRICSRS04Ref (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is... (Update)
Active bibliography (related documents): More All
0.2: Computing Symbolic Models for Verifying Cryptographic Protocols - Fiore, Abadi (2001) (Correct)
0.2: On the Expressiveness of Infinite Behavior and Name.. - Giambiagi.. (2004) (Correct)
0.2: On the Expressiveness of CCS-like Calculi - Giambiagi, Schneider, Valencia (2004) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
0.2: Undecidability of Domino Games - And Hhp-Bisimilarity Marcin (Correct)
0.2: Migration = Cloning ; Aliasing - Hüttel, Kleist, al. (1998) (Correct)
BibTeX entry: (Update)
@misc{ replication-basic,
author = "Recursion Vs Replication",
title = "Basic Research in Computer Science",
url = "citeseer.ist.psu.edu/734124.html" }
Citations (may not include all citations):71 Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
59 A bisimulation method for cryptographic protocols - Abadi, Gordon - 1998
50 the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
48 Non interference for the analysis of cryptographic protocols - Focardi, Gorrieri et al. - 2000
43 The polyadic pi-calculus: a tutorial - Milner - 1993
35 Protocol insecurity with a finite number of sessions and com.. - Rusinowitch, Turuani - 2003
34 the security of ping-pong protocols (context) - Dolev, Even et al. - 1982
32 Symbolic trace analysis of cryptographic protocols - Boreale - 2001
30 Computing symbolic models for verifying cryptographic protoc.. - Fiore, Abadi - 2001
23 Information and Computation (context) - Mayr, systems - 2000
21 On name generation and set-based analysis in the Dolev-Yao m.. - Amadio, Charatonik - 2002
20 Verification on infinite structures - Burkart, Caucal et al. - 2001
19 the symbolic reduction of processes with cryptographic funct.. (context) - Amadio, Lugiez et al. - 2002
6 Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
5 recursive definitions in channel based calculi (context) - Busi, Gabbrielli et al. - 2003
1 the expressiveness of infinite behavior and name scoping - Giambiagi, Schneider et al. - 2004
1 Extended process rewrite systems: Expressiveness and reachab.. (context) - Kretnsky, Rehak et al. - 2004
1 the expressive power of temporal concurrent constraint progr.. - Nielsen, Palamidessi et al. - 2002
1 Recursive ping-pong protocols (context) - Huttel, Srba - 2004
Documents on the same site (http://www.brics.dk/RS/04/Ref/BRICS-RS-04-Ref/BRICS-RS-04-Ref.html): More
Congruences for Contextual Graph-Rewriting - Sassone, Sobocinski (2004) (Correct)
The Design Space of Type Checkers for XML Transformation.. - Mĝller, Schwartzbach (2004) (Correct)
Split-2 Bisimilarity has a Finite Axiomatization over CCS with.. - Aceto, al. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC