R. Ramanujam, S. P. Suresh  Home/Search
Context Related
| dsi.unive.it/IFIPWG1_7/WITS2003/...2.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: dsi.unive.it/IFIPWG1_7/WITS200... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we propose a simple syntactic restriction on protocols and show that it achieves this purpose. The condition essentially states that between any two terms that occur in distinct communications, no encrypted subterm of one can be uni ed with a subterm of the other. In the absence of such a restriction, the intruder may use such a binding to transfer information from one play to another, and `pump' this process (using unboundedly many nonces) to generate unboundedly many plays with... (Update)
Cited by: More
A Method for Symbolic Analysis of Security Protocols - Boreale, Buscemi (Correct)
Active bibliography (related documents): More All
0.1: A Tool for Checking Protocol Security - Monahan (2002) (Correct)
0.1: Tree Automata With One Memory, Set Constraints and Cryptographic.. - Comon (Correct)
0.1: Verifying Secrecy by Abstract Interpretation - Bozga, Lakhnech, Périn (2002) (Correct)
Similar documents based on text: More All
0.4: Towards a Completeness Result for Model Checking of Security.. - Lowe (1998) (Correct)
0.3: Towards a Completeness Result for Model Checking of Security.. - Lowe (1999) (Correct)
0.3: Analyzing a Library of Security Protocols using Casper and FDR - Donovan, Norris, Lowe (1999) (Correct)
BibTeX entry: (Update)
R. Ramanujam and S.P. Suresh. A decidable subclass of unbounded security protocols. In WITS'03, 2003. 26 http://citeseer.ist.psu.edu/ramanujam03decidable.html More
@misc{ ramanujam03decidable,
author = "R. Ramanujam and S. Suresh",
title = "A decidable subclass of unbounded security protocols",
text = "R. Ramanujam and S.P. Suresh. A decidable subclass of unbounded security
protocols. In WITS'03, 2003. 26",
year = "2003",
url = "citeseer.ist.psu.edu/ramanujam03decidable.html" }
Citations (may not include all citations):263 The inductive approach to verifying cryptographic protocols - Paulson - 1998
171 Prudent engineering practices for cryptographic protocols - Abadi, Needham - 1996
75 Towards a completeness result for model checking of security.. - Lowe - 1998
47 Strand Spaces: Proving Security Protocols Correct - abrega, Herzog et al. - 1999
47 Constraint Solving for Bounded-Process Cryptographic Protoco.. - Millen, Shmatikov - 2001
44 A survey of authentication protocol literature (context) - Clark, Jacob - 1997
37 A model for secure protocols and their composition - Heintze, Tygar - 1996
12 Is it possible to decide whether a cryptographic protocol is.. - Comon, Shmatikov - 2002
1 An equivalence on terms for security protocols (context) - Ramanujam, Suresh - 2003
http://www.cs.bell-labs.com/who/nch/fmsp99/program.html
Documents on the same site (http://www.dsi.unive.it/IFIPWG1_7/WITS2003/papers/): More
Reputation-Based Trust Management (Extended Abstract) - Shmatikov, Talcott (2003) (Correct)
An Enhanced CFA for Security Policies - Bodei, Degano, Priami, Zannone (Correct)
Verification of Copy-Protection Cryptographic Protocol using.. - Genet, Tong (2003) (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