Section: New Results
Soundness Results: Some Limitations
Participant : Hubert Comon-Lundh.
Soundness results aim at bridging the gap between computational and symbolic security; they show that some symbolic model, in which messages are terms and the attacker is a formal process, faithfully abstracts the computational model, in which messages are bitstrings and the attacker is any probabilistic polynomial time Turing machine. Such results allow one to derive strong security guarantees, while reasoning at an abstract level. They have been developed for several cryptographic primitives (e.g. symmetric and asymmetric encryption, signatures, hash) and security properties.
These results however suffer from some severe limitations, as Hubert Comon-Lundh and Véronique Cortier demonstrate  , focusing on symmetric encryption.