conference paper published Yevgeniy Dodis author Roberto Oliveira author Krzysztof Z Pietrzak author 3E04A7AA-F248-11E8-B48F-1D18A9856A870000-0002-9139-1654 CRYPTO: International Cryptology Conference The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m is computed as f−1(h(m)) (here f ∈R F and h is modelled as a random oracle). It is known to be existentially unforgeable for any TDP family F [3], although a much tighter security reduction is known for a restrictive class of TDP’s [10,14] — namely, those induced by a family of claw-free permutations (CFP) pairs. The latter result was shown [11] to match the best possible “black-box” security reduction in the random oracle model, irrespective of the TDP family F (e.g., RSA) one might use. In this work we investigate the question if it is possible to instantiate the random oracle h with a “real” family of hash functions H such that the corresponding schemes can be proven secure in the standard model, under some natural assumption on the family F. Our main result rules out the existence of such instantiations for any assumption on F which (1) is satisfied by a family of random permutations; and (2) does not allow the attacker to invert f ∈R F on an a-priori unbounded number of points. Moreover, this holds even if the choice of H can arbitrarily depend on f. As an immediate corollary, we rule out instantiating FDH based on general claw-free permutations, which shows that in order to prove the security of FDH in the standard model one must utilize significantly more structure on F than what is sufficient for the best proof of security in the random oracle model. Springer Nature2005 Santa Barbara, CA, United States eng 978354028114610.1007/11535218_27 3621449 - 466 yes Dodis, Yevgeniy, et al. “On the Generic Insecurity of the Full Domain Hash.” <i>25th Annual International Cryptology Conference</i>, vol. 3621, Springer Nature, 2005, pp. 449–66, doi:<a href="https://doi.org/10.1007/11535218_27">10.1007/11535218_27</a>. Dodis, Yevgeniy, Roberto Oliveira, and Krzysztof Z Pietrzak. “On the Generic Insecurity of the Full Domain Hash.” In <i>25th Annual International Cryptology Conference</i>, 3621:449–66. Springer Nature, 2005. <a href="https://doi.org/10.1007/11535218_27">https://doi.org/10.1007/11535218_27</a>. Dodis, Y., Oliveira, R., &#38; Pietrzak, K. Z. (2005). On the generic insecurity of the full domain hash. In <i>25th Annual International Cryptology Conference</i> (Vol. 3621, pp. 449–466). Santa Barbara, CA, United States: Springer Nature. <a href="https://doi.org/10.1007/11535218_27">https://doi.org/10.1007/11535218_27</a> Y. Dodis, R. Oliveira, and K. Z. Pietrzak, “On the generic insecurity of the full domain hash,” in <i>25th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2005, vol. 3621, pp. 449–466. Dodis Y, Oliveira R, Pietrzak KZ. 2005. On the generic insecurity of the full domain hash. 25th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 3621, 449–466. Dodis Y, Oliveira R, Pietrzak KZ. On the generic insecurity of the full domain hash. In: <i>25th Annual International Cryptology Conference</i>. Vol 3621. Springer Nature; 2005:449-466. doi:<a href="https://doi.org/10.1007/11535218_27">10.1007/11535218_27</a> Y. Dodis, R. Oliveira, K.Z. Pietrzak, in:, 25th Annual International Cryptology Conference, Springer Nature, 2005, pp. 449–466. 32122018-12-11T12:02:03Z2026-07-02T08:05:18Z