Constraint solving for bounded-process cryptographic protocol analysis 论文
2001引用 313
Advanced Authentication Protocols SecurityUser Authentication and Security SystemsCryptography and Data Security
摘要
The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.