Leaky Random Oracle (Extended Abstract)
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- Constructing an Ideal Hash Function from Weak Ideal Compression Functions
- Hash-and-Sign with Weak Hashing Made Secure
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- On the Generic Insecurity of the Full Domain Hash
- Random Oracles and Auxiliary Input
- Secure integration of asymmetric and symmetric encryption schemes
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Stronger Security of Authenticated Key Exchange
- The random oracle methodology, revisited.
Cited in
(12)- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
- Random oracle model and analysis of primitives of a cryptographic scheme
- Salvaging Merkle-Damgård for Practical Applications
- How to confirm cryptosystems security: the original Merkle-Damgård is still alive!
- Strengthening the known-key security notion for block ciphers
- On pseudo-random oracles
- Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
- A modular approach to the incompressibility of block-cipher-based AEADs
- Sequential indifferentiability of confusion-diffusion networks
- Revisiting the indifferentiability of the sum of permutations
This page was built for publication: Leaky Random Oracle (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505472)