On the Decidability of Cryptographic Protocols with Open-Ended Data Structures

Ralf Küsters. On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. In Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera, editors, CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Volume 2421 of Lecture Notes in Computer Science, pages 515-530, Springer, 2002. [doi]

Abstract

Abstract is missing.