Chapter

Advances in Cryptology – ASIACRYPT 2009

Volume 5912 of the series Lecture Notes in Computer Science pp 303-318

Non-malleable Statistically Hiding Commitment from Any One-Way Function

  • Zongyang ZhangAffiliated withDepartment of Computer Science and Engineering, Shanghai Jiao Tong University
  • , Zhenfu CaoAffiliated withDepartment of Computer Science and Engineering, Shanghai Jiao Tong University
  • , Ning DingAffiliated withDepartment of Computer Science and Engineering, Shanghai Jiao Tong University
  • , Rong MaAffiliated withDepartment of Computer Science and Engineering, Shanghai Jiao Tong University

Abstract

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 [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.