Reducing complexity assumptions for statistically-hiding commitment (Q1027978)

\textit{M. Naor} et al. [J. Cryptology 11, No. 2, 87--108 (1998; Zbl 0960.94016)] have shown how to construct statistically-hiding commitment schemes based on any one-way permutation. This paper discusses the construction with one-way functions for which the value of pre-images each of the outputs can be efficiently estimated. A special case is the class of regular one-way functions where all points in the image of the function have the same number of pre-images.