Hash Functions from Sigma Protocols and Improvements to VSH

  • Mihir Bellare
  • Todor Ristov
Conference paper

DOI: 10.1007/978-3-540-89255-7_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5350)
Cite this paper as:
Bellare M., Ristov T. (2008) Hash Functions from Sigma Protocols and Improvements to VSH. In: Pieprzyk J. (eds) Advances in Cryptology - ASIACRYPT 2008. ASIACRYPT 2008. Lecture Notes in Computer Science, vol 5350. Springer, Berlin, Heidelberg


We present a general way to get a provably collision-resistant hash function from any (suitable) Σ− 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 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 Σ− 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Todor Ristov
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of California San DiegoLa JollaUSA

Personalised recommendations