Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Thayer  Home/Search
Context
Related
| iacr.org/2006/435.pdf 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: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a method for enumerating all essentially di#erent executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occurring protocols have only finitely many, indeed very few shapes. Authentication and secrecy properties are easy to determine from them, as are attacks. cpsa, our Cryptographic Protocol Shape Analyzer, implements the method. (Update)
Active bibliography (related documents): More All
1.0: Deciding knowledge properties of security protocols - Ramanujam, Suresh (Correct)
0.3: Security Protocol Design via Authentication Tests - Guttman (2002) (Correct)
0.3: Exercise on Implementing the Authentication Tests - Guttman (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ doghmi-searching,
author = "Shaddin F. Doghmi and Joshua D. Guttman and F. Javier Thayer",
title = "Searching for Shapes in Cryptographic Protocols",
url = "citeseer.ist.psu.edu/761742.html" }
Citations (may not include all citations):373 clocks and the ordering of events in a distributed system (context) - Lamport - 1978
322 Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
81 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
50 the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
47 Constraint solving for bounded-process cryptographic protoco.. - Millen, Shmatikov - 2001
35 and Roger Needham (context) - Burrows, Abadi - 1989
21 Relations between secrets: Two formal analyses of the Yahalo.. - Paulson - 1997
20 Theoretical Computer Science (context) - Guttman, Thayer et al. - 2002
16 ects for asymmetric cryptographic protocols (context) - Gordon, Je et al. - 2003
9 Multiset rewriting and the complexity of bounded security pr.. - Durgin, Lincoln et al. - 2004
5 Hellman key-agreement scheme in the strand-space model (context) - Herzog, e- - 2003
3 Electronic Notes in Theoretical Computer Science (context) - Guttman, the - 2001
2 Verification of cryptographic protocols: Tagging enforces te.. - Blanchet, Podelski - 2003
2 Decidability of context-explicit security protocols (context) - Ramanujam, Suresh - 2005
1 Skeletons and the shapes of bundles (context) - Doghmi, Guttman et al. - 2005
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (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