Using Task-Structured Probabilistic I/O Automata to Analyze Cryptographic Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Using Task-Structured Probabilistic I/O Automata to Analyze Cryptographic Protocols

Abstract

The Probabilistic I/O Automata (PIOA) framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness based on implementation relationships between multiple levels of abstraction. We enhance this framework to allow the analysis of protocols that use cryptographic primitives. For this purpose, we propose new techniques for handling nondeterministic behaviors, expressing computationally hardness assumptions, and for proving security in a composable setting.
Fichier principal
Vignette du fichier
paper7.pdf (119.37 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00080681 , version 1 (20-06-2006)

Identifiers

  • HAL Id : inria-00080681 , version 1

Cite

Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, et al.. Using Task-Structured Probabilistic I/O Automata to Analyze Cryptographic Protocols. Workshop on Formal and Computational Cryptography (FCC 2006), Véronique Cortier et Steve Kremer, Jul 2006, Venice/Italy. ⟨inria-00080681⟩

Collections

FCC2006
70 View
149 Download

Share

Gmail Facebook Twitter LinkedIn More