[Resource Topic] 2012/019: Towards Unconditional Soundness: Computationally Complete Symbolic Attacker

Welcome to the resource topic for 2012/019

Title:
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker

Authors: Gergei Bana, Hubert Comon-Lundh

Abstract:

We consider the question of the adequacy of symbolic models versus computational models for the verification of security protocols. We neither try to include properties in the symbolic model that reflect the properties of the computational primitives nor add computational requirements that enforce the soundness of the symbolic model. We propose in this paper a different approach: everything is possible in the symbolic model unless it contradicts a computational assumption. In this way, we obtain unconditional soundness almost by construction. And we do not need to assume the absence of dynamic corruption or the absence of key-cycles, which are examples of hypotheses that are always used in related works. We set the basic framework, for arbitrary cryptographic primitives and arbitrary protocols, however for trace security properties only.

ePrint: https://eprint.iacr.org/2012/019

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .