CryptoDB
Hash Functions from Sigma Protocols and Improvements to VSH
Authors: | |
---|---|
Download: | |
Abstract: | We present a general way to get a provably collision-resistant hash function from any (suitable) $\Sigma$-protocol. This enables us to both get new designs and to unify and improve previous work. In the first category, we obtain, via a modified version of the Fiat-Shamir protocol, the fastest known hash function that is provably collision-resistant based on the \textit{standard} factoring assumption. In the second category, we provide a modified version VSH^* of VSH which is faster when hashing short messages. (Most Internet packets are short.) We also show that $\Sigma$-hash functions are chameleon, thereby obtaining several new and efficient chameleon hash functions with applications to on-line/off-line signing, chameleon signatures and designated-verifier signatures. |
BibTeX
@misc{eprint-2008-18159, title={Hash Functions from Sigma Protocols and Improvements to VSH}, booktitle={IACR Eprint archive}, keywords={hash functions, collision-resistance,Fiat-Shamir}, url={http://eprint.iacr.org/2008/379}, note={Preliminary version in Asiacrypt 2008. This is the full version. tristov@cs.ucsd.edu 14183 received 5 Sep 2008, last revised 31 Oct 2008}, author={Mihir Bellare and Todor Ristov}, year=2008 }