On the Generic Insecurity of the Full Domain Hash
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1759781
- Optimal security proofs for full domain hash. Revisited
- Optimal security proofs for full domain hash, revisited
- On capabilities of hash domain extenders to preserve enhanced security properties
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- scientific article; zbMATH DE number 1942447
- Generic attacks on hash combiners
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
Cited in
(41)- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Leakage resilience of the Blom's key distribution scheme
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public key encryption with equality test from generic assumptions in the random oracle model
- Optimal security proofs for full domain hash. Revisited
- Public key encryption with equality test via hash proof system
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Programmable hash functions and their applications
- Public key encryption with equality test in the standard model
- Optimal security proofs for full domain hash, revisited
- Short variable length domain extenders with beyond birthday bound security
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Linkable ring signature scheme with stronger security guarantees
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- On tight security proofs for Schnorr signatures
- Possibility and impossibility results for selective decommitments
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Leaky Random Oracle (Extended Abstract)
- Augmented random oracles
- On the instantiability of hash-and-sign RSA signatures
- Programmable Hash Functions and Their Applications
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- The random oracle model: a twenty-year retrospective
- New limits for homomorphic encryption
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Instantiability of RSA-OAEP under chosen-plaintext attack
- New limits of provable security and applications to ElGamal encryption
- A unified approach to idealized model separations via indistinguishability obfuscation
- Toward RSA-OAEP without random oracles
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- How (not) to design strong-RSA signatures
- Non-adaptive programmability of random oracle
- Improving signature schemes with tight security reductions
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- On the impossibility of instantiating PSS in the standard model
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451042)
