Skip to Main content Skip to Navigation
Conference papers

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

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00080675
Contributor : Véronique Cortier <>
Submitted on : Tuesday, June 20, 2006 - 3:02:02 PM
Last modification on : Tuesday, June 20, 2006 - 3:28:13 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:06:40 PM

Identifiers

  • HAL Id : inria-00080675, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

84

Files downloads

304