Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

@article{Tiplea2008SecrecyFB,
  title={Secrecy for bounded security protocols with freshness check is NEXPTIME-complete},
  author={Ferucio Laurentiu Tiplea and Catalin V. B{\^i}rjoveanu and Constantin Enea and Ioana Boureanu},
  journal={Journal of Computer Security},
  year={2008},
  volume={16},
  pages={689-712}
}
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating the formalism in this paper to the multiset rewriting (MSR) formalism we obtain that the initial secrecy problem for protocols in restricted form, with bounded length messages, bounded existentials, with or without disequality tests, and an… CONTINUE READING