Jonathan Millen, Vitaly Shmatikov  Home/Search
Context Related
| sri.com/~millen/capsl/decide.ps sri.com/~shmat/shmat_ccs01.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: sri.com/~millen/capsl/abstract (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure. (Update)
Cited by: More
A Comparison between Strand Spaces and Multiset.. - Cervesato, Durgin.. (2002) (Correct)
Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005) (Correct)
Searching for Shapes in Cryptographic Protocols - Doghmi, Guttman, Thayer (Correct)
Similar documents (at the sentence level):
62.8%: Constraint Solving for Bounded-Process - Cryptographic Protocol Analysis (Correct)
Active bibliography (related documents): More All
0.3: Computing Symbolic Models for Verifying Cryptographic Protocols - Fiore, Abadi (2001) (Correct)
0.3: Is It Possible to Decide Whether a Cryptographic Protocol Is .. - Common, Shmatikov (Correct)
0.2: Is It Possible to Decide Whether a Cryptographic Protocol is .. - Comon, Shmatikov (2001) (Correct)
Similar documents based on text: More All
0.5: Symbolic Protocol Analysis with Products and Diffie-Hellman.. - Millen, Shmatikov (2003) (Correct)
0.3: Negotiated Privacy (Extended Abstract) - Jarecki, Lincoln, Shmatikov (Correct)
0.2: MuCAPSL - Millen, Denker (Correct)
Related documents from co-citation: More All
25: the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
23: Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
22: The inductive approach to verifying cryptographic protocols - Paulson - 1998
BibTeX entry: (Update)
J. Millen and V. Shmatikov. Constraint solving for boundedprocess cryptographic protocol analysis. To appear in Proc. 8th ACM Conference on Computer and Communications Security, http://citeseer.ist.psu.edu/449378.html More
@inproceedings{ millen01constraint,
author = "Jonathan K. Millen and Vitaly Shmatikov",
title = "Constraint solving for bounded-process cryptographic protocol analysis",
booktitle = "{ACM} Conference on Computer and Communications Security",
pages = "166-175",
year = "2001",
url = "citeseer.ist.psu.edu/449378.html" }
Citations (may not include all citations):322 Breaking and fixing the Needham-Schroeder public-key protoco.. - LOWE - 1996
263 The inductive approach to verifying cryptographic protocols - PAULSON - 1998
71 Undecidability of bounded security protocols - DURGIN, LINCOLN et al. - 1999
50 the reachability problem in cryptographic protocols - AMADIO, LUGIEZ - 2000
43 Honest ideals on strand spaces (context) - THAYER, HERZOG et al. - 1998
42 Relating strands and multiset rewriting for security protoco.. - CERVESATO, DURGIN et al. - 2000
37 A model for secure protocols and their compositions - HEINTZE, TYGAR - 1996
35 Protocol insecurity with finite number of sessions is NP-com.. - RUSINOWITCH, TURUANI - 2001
31 Athena: a new efficient automatic checker for security proto.. - SONG - 1999
30 Computing symbolic models for verifying cryptographic protoc.. - FIORE, ABADI - 2001
27 Using one-way functions for authentication - GONG - 1989
19 the symbolic reduction of processes with cryptographic funct.. (context) - AMADIO, LUGIEZ et al. - 2001
11 Efficient infinite-state analysis of security protocols - HUIMA - 1999
8 The SSL protocol (context) - FREIER, KARLTON et al.
6 Symbolic analysis of cryptographic protocols in the spi-calc.. - BOREALE - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csl.sri.com/~millen/capsl/abstract.html): More
CAPSL Integrated Protocol Environment - Denker, Millen (2000) (Correct)
Optimizing Protocol Rewrite Rules of CIL Specifications - Denker, Millen, Grau, Filipe (2000) (Correct)
Proving Secrecy is Easy Enough - Cortier, Millen (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