Proceedings of 30th IEEE Computer Security Foundations Symposium, (CSF 2017)

Publication Year




We introduce a new class of security protocols with an unbounded number of sessions and unlimited fresh data for which the problem of secrecy is decidable. The only constraint we place on the class is a notion of depth-boundedness. Precisely we prove that, restricted to messages of up to a given size, secrecy is decidable for all depth-bounded processes. This decidable fragment of security protocols captures many realworld symmetric key protocols, including Needham-SchroederSymmetric Key, Otway-Rees, and Yahalom.

Source Materials