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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5912)
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

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

Personalised recommendations