Go to DBLP homepageConstraint solving for bounded-process cryptographic protocol analysis
Abstract: The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview