Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
Ivan Damgård November 1994 |

## Abstract:In We adopt Damgård's methods, using ordinary hashing functions, instead of the abovementioned interactive hashing technique. Typically, the protocols we derive have much lower round-complexity than those derived by Damgård's transformation. As in Damgård's transformation, our transformation preserves statistical/perfect zero-knowledge and does not rely on any computational assumptions. However, unlike Damgård's transformation, the new transformation is not applicable to argument systems or to proofs of knowledge.
Available as |

Last modified: 2003-06-08 by webmaster.