A New Interactive Hashing Theorem

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 statisticallyhiding commitment schemes and of zero-knowledge arguments based on general one-way permutations and on oneway functions. Interactive hashing with respect to a oneway 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 inter...

• Type: Conference
• Year: 2007
• Where: COCO
• Authors: Iftach Haitner, Omer Reingold
• Keywords: COCO 2007, Interactive Hashing, One-way Permutation, Sender