Timed protocols insecurity problem is NP-complete

—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rusinowitch and M. Turuani [1] stated for the untimed case. We show that the extension to time and the increased power of the intruder model we propose do not affect the complexity of the problem which remains NP–Complete.

• Type: Journal
• Year: 2010
• Where: IEEEHPCS
• Authors: Massimo Benerecetti, Nicola Cuomo, Adriano Peron
• Keywords: Applied Computing, IEEEHPCS 2010, Protocol Insecurity Problem, Time Dependent Security, Timed Case