Title :
Timed protocols insecurity problem is NP-complete
Author :
Benerecetti, Massimo ; Cuomo, Nicola ; Peron, Adriano
Author_Institution :
Dept. of Phys. Sci., Univ. di Napoli Federico II, Naples, Italy
fDate :
June 28 2010-July 2 2010
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.
Keywords :
Complexity theory; Cryptography; Delay; Protocols; Semantics; Servers; Complexity; HPLSL; Security; THLPSL; Timed Protocols;
Conference_Titel :
High Performance Computing and Simulation (HPCS), 2010 International Conference on
Conference_Location :
Caen, France
Print_ISBN :
978-1-4244-6827-0
DOI :
10.1109/HPCS.2010.5547120
