An important problem in the analysis of security protocols is that of checking whether a protocol preserves secrecy, i.e., no secret owned by the honest agents is unintentionally revealed to the intruder. This problem has been proved to be undecidable in several settings. In particular, [11] prove the undecidability of the secrecy problem in the presence of an unbounded set of nonces, even when...