Is there any paper which can be used to show that there can be no relativizing construction of a secret-coin Collision-Resistant Hash Family from a one-way function and unlike this paper, does not claim to show more than it actually shows?The second link shows some result, and I believe that what it actually showsis strong enough, but I'm quite hesitant to cite that paper because the author writes we show that relative to an oracle non-interactive weakly-binding honest-receiver statistically-secret commitments schemes do not exist despite his definition of non-interactive weakly-binding honest-receiver statistically-secret bit commitment schemes corresponding to an otherwise semi-honest receiver that is allowed to choose its random bits maliciously, and requiring perfect completeness and gives a definition of a black-box one-way permutation that does not require injectivity.
one-way functions vs. secret-coin CRHFs
cr.crypto security;hash function;relativization;one way function