CryptoDB
Sound Computational Interpretation of Formal Hashes
Authors: | |
---|---|
Download: | |
Abstract: | This paper provides one more step towards bridging the gap between the formal and computational approaches to cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and we give precise semantic to it using Canetti's oracle hashing. Finally, we show that this interpretation is computationally sound. |
BibTeX
@misc{eprint-2006-21508, title={Sound Computational Interpretation of Formal Hashes}, booktitle={IACR Eprint archive}, keywords={foundations / hash functions, formal methods, formal hashes, Dolev-Yao, soundness}, url={http://eprint.iacr.org/2006/014}, note={in submission flaviog@cs.ru.nl 13161 received 13 Jan 2006}, author={Flavio D. Garcia and Peter van Rossum}, year=2006 }