Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists

Najah Chridi, Mathieu Turuani, Michaël Rusinowitch. Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. In Proceedings of the 22nd IEEE Computer Security Foundations Symposium, CSF 2009, Port Jefferson, New York, USA, July 8-10, 2009. pages 277-289, IEEE Computer Society, 2009. [doi]

@inproceedings{ChridiTR09,
  title = {Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists},
  author = {Najah Chridi and Mathieu Turuani and Michaël Rusinowitch},
  year = {2009},
  doi = {10.1109/CSF.2009.10},
  url = {http://doi.ieeecomputersociety.org/10.1109/CSF.2009.10},
  tags = {protocol, analysis},
  researchr = {https://researchr.org/publication/ChridiTR09},
  cites = {0},
  citedby = {0},
  pages = {277-289},
  booktitle = {Proceedings of the 22nd IEEE Computer Security Foundations Symposium, CSF 2009, Port Jefferson, New York, USA, July 8-10, 2009},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3712-2},
}