On the Generic Insecurity of the Full Domain Hash

DOI10.1007/11535218_27zbMath1145.94440OpenAlexW1559365371MaRDI QIDQ5451042

Krzysztof Pietrzak, Yevgeniy Dodis, Roberto Imbuzeiro Oliveira

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_27

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (29)

Toward RSA-OAEP Without Random Oracles ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Public key encryption with equality test in the standard model ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles ⋮ The random oracle model: a twenty-year retrospective ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ On tight security proofs for Schnorr signatures ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Augmented random oracles ⋮ How (not) to design strong-RSA signatures ⋮ Programmable hash functions and their applications ⋮ Possibility and impossibility results for selective decommitments ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Non-adaptive programmability of random oracle ⋮ Programmable Hash Functions and Their Applications ⋮ CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ Public key encryption with equality test via hash proof system ⋮ Leaky Random Oracle (Extended Abstract) ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: On the Generic Insecurity of the Full Domain Hash