Constraint solving for bounded-process cryptographic protocol analysis
- 5 November 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 166-175
- https://doi.org/10.1145/501983.502007
Abstract
The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.Keywords
This publication has 2 references indexed in Scilit:
- A model for secure protocols and their compositionsIEEE Transactions on Software Engineering, 1996
- Using one-way functions for authenticationACM SIGCOMM Computer Communication Review, 1989