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. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Zhang, Z., Cao, Z., Ding, N., & Ma, R. (2009). Non-malleable statistically hiding commitment from any one-way function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5912 LNCS, pp. 303–318). https://doi.org/10.1007/978-3-642-10366-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
