ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Third Annual IEEE Symposium on

Logic in Computer Science (LICS 2008)

Invited Paper: Cryptographically-Sound Protocol-Model Abstractions (at LICS 2008)

Authors: Christoph Sprenger David A. Basin


We present a formal theory for cryptographically-sound theorem proving. Our starting point is the Backes-Pfitzmann-Waidner (BPW) model, which is a symbolic protocol model that is cryptographically sound in the sense of blackbox reactive simulatability. To achieve cryptographic soundness, this model is substantially more complex than standard symbolic models and the main challenge in formalizing and using this model is overcoming this complexity. We present a series of cryptographically-sound abstractions of the original BPW model that bring it much closer to standard Dolev-Yao style models. We present a case study showing that our abstractions enable proofs of complexity comparable to those based on more standard models. Our entire development has been formalized in Isabelle/HOL.


    author = 	 {Christoph Sprenger and David A. Basin},
    title = 	 {Cryptographically-Sound Protocol-Model Abstractions},
    booktitle =  {Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008)},
    year =	 {2008},
    month =	 {June}, 
    pages =      {3--17},
    location =   {Pittsburgh, PA, USA}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}

Last modified: 2022-10-3113:49
Sam Staton