Non-malleable Statistically Hiding Commitment from Any One-Way Function
- Cite this paper as:
- Zhang Z., Cao Z., Ding N., Ma R. (2009) Non-malleable Statistically Hiding Commitment from Any One-Way Function. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg
We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold , and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor , and requires only the use of black-box techniques.