Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests

In this paper, we extend some complexity results on thesecrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.