In this paper, mostly consisting of definitions, we revisit the models of security protocols: we show that the symbolic and the computational models (as well as others) are instances of a same generic model. Our definitions are also parametrized by the security primitives, the notion of attacker and, to some extent, the process calculus.
@InProceedings{comonlundh:LIPIcs.FSTTCS.2008.1766, author = {Comon-Lundh, Hubert}, title = {{About models of security protocols}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {352--356}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1766}, URN = {urn:nbn:de:0030-drops-17662}, doi = {10.4230/LIPIcs.FSTTCS.2008.1766}, annote = {Keywords: Protocols, security, concurrency, formal methods} }
Feedback for Dagstuhl Publishing