Sciweavers

CCS
2001
ACM

132views Security Privacy» more CCS 2001»

13 years 9 months ago

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

Jonathan K. Millen, Vitaly Shmatikov

claim paper

Read More »