The Game of the Name in Cryptographic Tables

Abstract

We present a name-passing calculus that can be regarded as a simplified π-calculus equipped with a cryptographic table. The latter is a data structure representing the relationships among names. We illus- trate how the calculus may be used for modelling cryptographic protocols relying on symmetric shared keys and verifying secrecy and authenticity properties. Following classical approaches [3], we formulate the verifica- tion task as a reachability problem and prove its decidability assuming finite principals and bounds on the sorts of the messages synthesized by the attacker.