HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

The Game of the Name in Cryptographic Tables

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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:18:43 AM
Last modification on : Friday, February 4, 2022 - 3:17:17 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:28:22 PM


  • 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⟩



Record views


Files downloads