The Game of the Name in Cryptographic Tables

Roberto M. Amadio 1 Sanjiva Prasad
1 MEIJE - Concurrency, Synchronization and Real-time Programming
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We present a name-passing calculus that can be regarded as a simplified pi-calculus equipped with a cryptographic table. The latter is a data structure representing the relationships among names. We apply the calculus to the modelling and verification of secrecy and authenticity properties in cryptographic protocols relying on symmetric shared keys. Following classical approaches [8], we formulate the verification task as a reachability problem and prove its decidability assuming finite principals and bounds on the sorts of the messages synthesized by the attacker.
Type de document :
RR-3733, INRIA. 1999
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:18:43
Dernière modification le : samedi 27 janvier 2018 - 01:31:03
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:28:22



  • HAL Id : inria-00072932, version 1



Roberto M. Amadio, Sanjiva Prasad. The Game of the Name in Cryptographic Tables. RR-3733, INRIA. 1999. 〈inria-00072932〉



Consultations de la notice


Téléchargements de fichiers