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]
@inproceedings{BenerecettiCP10,
title = {Timed protocols insecurity problem is NP-complete},
author = {Massimo Benerecetti and Nicola Cuomo and Adriano Peron},
year = {2010},
doi = {10.1109/HPCS.2010.5547120},
url = {http://dx.doi.org/10.1109/HPCS.2010.5547120},
tags = {completeness, protocol},
researchr = {https://researchr.org/publication/BenerecettiCP10},
cites = {0},
citedby = {0},
pages = {274-282},
booktitle = {Proceedings of the 2010 International Conference on High Performance Computing & Simulation, HPCS 2010, June 28 - July 2, 2010, Caen, France},
editor = {Waleed W. Smari and John P. McIntire},
publisher = {IEEE},
isbn = {978-1-4244-6828-7},
}