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.
Timed protocols insecurity problem is NP-complete / Benerecetti, M., Cuomo, N., Peron, A.. - (2010), pp. 274-282. (International Conference on High Performance Computing & Simulation, HPCS 2010 Caen, France 28 Giugno - 2 Luglio 2010) [10.1109/HPCS.2010.5547120].
Timed protocols insecurity problem is NP-complete
PERON, ADRIANOUltimo
2010-01-01
Abstract
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Timed_protocols_insecurity_problem_is_NP-complete.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
373.16 kB
Formato
Adobe PDF
|
373.16 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
