Protocol Insecurity with Finite Number of Sessions is NP-Complete

Michaël Rusinowitch, Mathieu Turuani. Protocol Insecurity with Finite Number of Sessions is NP-Complete. In 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 11-13 June 2001, Cape Breton, Nova Scotia, Canada. pages 174, IEEE Computer Society, 2001. [doi]

@inproceedings{RusinowitchT01,
  title = {Protocol Insecurity with Finite Number of Sessions is NP-Complete},
  author = {Michaël Rusinowitch and Mathieu Turuani},
  year = {2001},
  url = {http://csdl.computer.org/comp/proceedings/csfw/2001/1146/00/11460174abs.htm},
  tags = {completeness, protocol},
  researchr = {https://researchr.org/publication/RusinowitchT01},
  cites = {0},
  citedby = {0},
  pages = {174},
  booktitle = {14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 11-13 June 2001, Cape Breton, Nova Scotia, Canada},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-1146-5},
}