International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2009: Advances in Cryptology – ASIACRYPT 2009 pp 303-318

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

  • Zongyang Zhang
  • Zhenfu Cao
  • Ning Ding
  • Rong Ma
Conference paper

DOI: 10.1007/978-3-642-10366-7_18

Volume 5912 of the book series Lecture Notes in Computer Science (LNCS)

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Zongyang Zhang
    • 1
  • Zhenfu Cao
    • 1
  • Ning Ding
    • 1
  • Rong Ma
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityP.R. China