Towards Unconditional Soundness: Computationally Complete Symbolic Attacker (bibtex)
by 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.
Reference:
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker (Gergei Bana, Hubert Comon-Lundh), In 2nd Conference on Principles of Security and Trust (POST 2012), Springer Verlag, volume 7215, 2012.
Bibtex Entry:
@string{spv="Springer Verlag"}
@inproceedings{DBLP:conf/post/BanaC12,
  author    = {Gergei Bana and
               Hubert Comon-Lundh},
  title     = {Towards Unconditional Soundness: Computationally Complete
               Symbolic Attacker},
  booktitle = {2nd Conference on Principles of Security and Trust (POST 2012)},
  year      = {2012},
  pages     = {189-208},
	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.},
	volume =  {7215}, 
	pages = {189-208},
	series = llncs,
	publisher = spv
}
Powered by bibtexbrowser