It needs to be not just a second algorithm but a parametric hash function. So after an image B has been found which matches illegal image A on f(B)=f(A) then th

It needs to be not just a second algorithm but a parametric hash function. So after an image B has been found which matches illegal image A on f(B)=f(A) then the server picks a random number R and sends the client R,f(A,R) and the client checks if f(B,R) =f(A,R) as well. Do we have such a hash function?