Secrecy for Bounded Security Protocols without Freshness Check

Abstract

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open.