
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
Author(s) -
Hubert Comon-Lundh,
Véronique Cortier
Publication year - 2011
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - soundness , mathematical proof , computer science , cryptographic protocol , cryptography , theoretical computer science , encryption , cryptographic primitive , symmetric key algorithm , hash function , computer security , public key cryptography , programming language , mathematics , geometry