Sound and Complete Computational Interpretation of Symbolic Hashes in the Standard Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Sound and Complete Computational Interpretation of Symbolic Hashes in the Standard Model

Abstract

This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and give a precise semantic interpretation to it using Canetti's oracle hashes. These are probabilistic polynomialtime hashes that hide all partial information. Finally, we show that this interpretation is computationally sound and complete.
Fichier principal
Vignette du fichier
paper5.pdf (118.68 Ko) Télécharger le fichier
Loading...

Dates and versions

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

Identifiers

  • HAL Id : inria-00080675 , version 1

Cite

Flavio D. Garcia, Peter van Rossum. Sound and Complete Computational Interpretation of Symbolic Hashes in the Standard Model. Workshop on Formal and Computational Cryptography (FCC 2006), Véronique Cortier et Steve Kremer, Jul 2006, Venice/Italy. ⟨inria-00080675⟩

Collections

FCC2006
19 View
110 Download

Share

Gmail Facebook Twitter LinkedIn More