Timed protocols insecurity problem is NP-complete

Massimo Benerecetti, Nicola Cuomo, Adriano Peron. Timed protocols insecurity problem is NP-complete. In Waleed W. Smari, John P. McIntire, editors, Proceedings of the 2010 International Conference on High Performance Computing & Simulation, HPCS 2010, June 28 - July 2, 2010, Caen, France. pages 274-282, IEEE, 2010. [doi]

Authors

Massimo Benerecetti

This author has not been identified. Look up 'Massimo Benerecetti' in Google

Nicola Cuomo

This author has not been identified. Look up 'Nicola Cuomo' in Google

Adriano Peron

This author has not been identified. Look up 'Adriano Peron' in Google