Roberto M. Amadio, Witold Charatonik  Home/Search
Context Related
| mpisb.mpg.de/~witold/paper...concur.ps 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: mpisb.mpg.de/~witold/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the control reachability problem in the Dolev-Yao model of cryptographic protocols when principals are represented by tail recursive processes with generated names. We propose a conservative approximation of the problem by reduction to a non-standard collapsed operational semantics and we introduce checkable syntactic conditions entailing the equivalence of the standard and the collapsed semantics. (Update)
Cited by: More
Basic Research in Computer Science - Recursion Vs Replication (Correct)
Profundis: - Periodic Progress Report (Correct)
Intruder Deductions, Constraint Solving and Insecurity.. - Comon-Lundh, Shmatikov (Correct)
Active bibliography (related documents): More All
1.9: On Name Generation and Set-Based Analysis in Dolev-Yao Model - Amadio, Charatonik (2002) (Correct)
0.3: Solving Dominance Constraints with Finite Set Constraint.. - Duchier, Niehren (1999) (Correct)
0.3: On Message Deliverability and Non-Uniform Receptivity - Amadio, Boudol, Lhoussaine (2001) (Correct)
Similar documents based on text: More All
0.4: The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999) (Correct)
0.3: On the Reachability Problem in Cryptographic Protocols - Amadio, Lugiez (2000) (Correct)
0.3: Modelling IP Mobility - Amadio, Prasad (1997) (Correct)
Related documents from co-citation: More All
20: Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
14: Tree automata with one memory (context) - Comon, Cortier et al.
11: Protocol insecurity with finite number of sessions is NP-complete - RUSINOWITCH, TURUANI - 2001
BibTeX entry: (Update)
R. Amadio and W. Charatonik. On name generation and set-based analysis in the dolev-yao model. In Proc. CONCUR 02. Springer-Verlag, 2002. http://citeseer.ist.psu.edu/article/amadio02name.html More
@misc{ amadio02name,
author = "R. Amadio and W. Charatonik",
title = "On name generation and set-based analysis in the dolev-yao model",
text = "R. Amadio and W. Charatonik. On name generation and set-based analysis
in the dolev-yao model. In Proc. CONCUR 02. Springer-Verlag, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/amadio02name.html" }
Citations (may not include all citations):97 the security of public key protocols (context) - Dolev, Yao - 1983
82 A decision procedure for a class of set constraints - Heintze, Ja - 1990
71 Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
50 A survey of authentication protocol literature: Version - Clark, Jacob - 1997
39 Set constraints and set-based analysis - Heintze, Ja - 1994
38 Set constraints with intersection - Charatonik, Podelski - 1997
34 Abstracting cryptographic protocols with tree automata - Monniaux - 1999
34 the security of ping-pong protocols (context) - Dolev, Even et al. - 1982
31 Tree automata with one memory (context) - Comon, Cortier et al. - 2001
21 On name generation and set-based analysis in the Dolev-Yao m.. - Amadio, Charatonik - 2002
19 the symbolic reduction of processes with cryptographic funct.. (context) - Amadio, Lugiez et al.
19 A method for automatic cryptographic protocol veri cation - Goubault - 2000
13 A bound on attacks on authentication protocols - Stoller - 1999
8 Rewriting for cryptographic protocol veri cation (context) - Genet, Klay - 2000
7 trees in set-based program analysis (context) - Charatonik, Podelski et al. - 2000
6 Towards an automatic analysis of security protocols in rstor.. (context) - Weidenbach - 1999
3 the decidability of fragments of the asynchronous -calculus (context) - Amadio, Meyssonnier
3 Generalized de nite set constraints (context) - Talbot, Devienne et al. - 2000
2 Turuani Protocol insecurity with nite number of sessions is .. (context) - Rusinowitch - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~witold/): More
Solving Set Constraints for Greatest Models - Charatonik, Podelski (1997) (Correct)
Set-based Error Diagnosis of Concurrent Constraint Programs - Podelski, Charatonik, Müller (1997) (Correct)
The Independence Property of a Class of Set Constraints - Charatonik, Podelski (1996) (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