Sciweavers

IEEEHPCS
2010
13 years 3 months ago
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. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron