DMCA
A new interactive hashing theorem (2007)
Cached
Download Links
| Venue: | In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity |
| Citations: | 13 - 5 self |
BibTeX
@INPROCEEDINGS{Haitner07anew,
author = {Iftach Haitner and Omer Reingold},
title = {A new interactive hashing theorem},
booktitle = {In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity},
year = {2007},
pages = {319--332}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major component in all known constructions of statistically hiding and computationally binding commitment schemes and of zero-knowledge arguments based on general one-way permutations and on oneway functions. Interactive hashing with respect to a one-way permutation f, is a two-party protocol that enables a sender that knows y = f(x) to transfer a random hash z = h(y) to a receiver. The receiver is guaranteed that the sender is committed to y (in the sense that it cannot come up with x and x ′ such that f(x) � = f(x ′), but h(f(x)) = h(f(x ′)) = z). The sender is guaranteed that the receiver does not learn any additional information on y. In particular, when h is a two-to-one hash function, the receiver does not learn which of the two preimages {y, y ′ } = h −1 (z) is the one the sender can invert with respect to f. This paper reexamines the notion of interactive hashing. We give an alternative proof for the Naor et al. protocol, which seems to us significantly simpler and more intuitive than the original one. Moreover, the new proof achieves much better parameters (in terms of how security
Keyphrases
interactive hashing new interactive hashing theorem important role major component one-way permutation new proof achieves original one oneway function zero-knowledge argument many cryptographic protocol alternative proof random hash two-party protocol known construction binding commitment scheme additional information two-to-one hash function general one-way permutation
