Cryptology ePrint Archive: Report 2006/146

Completeness of Formal Hashes in the Standard Model

Flavio D. Garcia and Peter van Rossum

Abstract: We study an extension of the well-known Abadi-Rogaway logic with hashes. Previously, we have given a sound computational interpretation of this extension using Canetti's oracle hashing. This paper extends Micciancio and Warinschi's completeness result for the original logic to this setting.

Category / Keywords: foundations / hash functions, formal methods, symbolic hashes, Dolev-Yao, completeness, standard model

Publication Info: in submission

Date: received 13 Apr 2006

Contact author: petervr at cs ru nl

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20060413:183121 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]