Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CCS
2001
ACM

favoriteEmaildiscussreport

132views Security Privacy» more CCS 2001»

Constraint solving for bounded-process cryptographic protocol analysis

13 years 8 months ago

Constraint solving for bounded-process cryptographic protocol analysis

Download www.csl.sri.com

The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.

Jonathan K. Millen, Vitaly Shmatikov

Real-time Traffic

CCS 2001 | Constraint Satisfaction Procedure | Reachability Problem | Security Privacy |

claim paper

Related Content

» What is the best way to prove a cryptographic protocol correct

» Constraint Solving for ContractSigning Protocols

» Intruder Deductions Constraint Solving and Insecurity Decision in Presence of Exclusive or

» Symbolic protocol analysis for monoidal equational theories

» Verifying Cryptographic Protocols with Subterms Constraints

» Cryptographic Protocol Analysis on Real C Code

» Automatic analysis of distance bounding protocols

» Compiling cryptographic protocols for deployment on the web

» Towards an Automatic Analysis of Web Service Security

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CCS
Authors	Jonathan K. Millen, Vitaly Shmatikov

Comments (0)