Paper 2011/335
New look at impossibility result on Dolev-Yao models with hashes
István Vajda
Abstract
Backes, Pfitzmann and Waidner showed in [7] that for protocols with hashes Dolev-Yao style models do not have cryptographically sound realization in the sense of BRSIM/UC in the standard model of cryptography. They proved that random oracle model provides a cryptographically sound realization. Canetti [9] introduced the notion of oracle hashing “towards realizing random oracles”. Based on these two approaches, we propose a random hash primitive, which already makes possible cryptographically sound realization in the sense of BRSIM/UC in the standard model of cryptography.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- cryptanalysishash functions
- Contact author(s)
- vajda @ hit bme hu
- History
- 2011-06-22: received
- Short URL
- https://ia.cr/2011/335
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/335,
author = {István Vajda},
title = {New look at impossibility result on Dolev-Yao models with hashes},
howpublished = {Cryptology ePrint Archive, Paper 2011/335},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/335}},
url = {https://eprint.iacr.org/2011/335}
}
