The Game of the Name in Cryptographic Tables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1999

The Game of the Name in Cryptographic Tables

Sanjiva Prasad
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3733.pdf (270.83 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072932 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072932 , version 1

Cite

Roberto M. Amadio, Sanjiva Prasad. The Game of the Name in Cryptographic Tables. RR-3733, INRIA. 1999. ⟨inria-00072932⟩
206 View
163 Download

Share

Gmail Facebook Twitter LinkedIn More