Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (2003)

by Michael Rusinowitch, Mathieu Turuani
Venue:Theor. Comput. Sci.,