Completeness of Formal Hashes in the Standard Model

Flavio D.  Garcia; Peter van Rossum

Paper 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.

Metadata

Available format(s): PDF PS
Category: Foundations
Publication info: Published elsewhere. in submission
Keywords: hash functions formal methods symbolic hashes Dolev-Yao completeness standard model
Contact author(s): petervr @ cs ru nl
History: 2006-04-13: received
Short URL: https://ia.cr/2006/146
License: CC BY

BibTeX

@misc{cryptoeprint:2006/146,
      author = {Flavio D.  Garcia and Peter van Rossum},
      title = {Completeness of Formal Hashes in the Standard Model},
      howpublished = {Cryptology ePrint Archive, Paper 2006/146},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/146}},
      url = {https://eprint.iacr.org/2006/146}
}