Building indifferentiable compression functions from the PGV compression functions
From MaRDI portal
Publication:5963372
Recommendations
- Indifferentiability of double length compression functions
- Ideal-cipher (ir)reducibility for blockcipher-based hash functions
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- An analysis of the blockcipher-based hash functions from PGV
- On the Weak Ideal Compression Functions
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 177045 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 1394313 (Why is no real title available?)
- A Failure-Friendly Design Principle for Hash Functions
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Advances in Cryptology – CRYPTO 2004
- An analysis of the blockcipher-based hash functions from PGV
- Blockcipher-Based Hashing Revisited
- Careful with composition: limitations of the indifferentiability framework
- Collisions and Near-Collisions for Reduced-Round Tiger
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- On the Indifferentiability of the Sponge Construction
- On the indifferentiability of the Grøstl hash function
- Salvaging Merkle-Damgård for Practical Applications
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Security analysis of randomize-hash-then-sign digital signatures
- Security analysis of the mode of JH hash function
- Theory of Cryptography
Cited in
(6)- Better concrete security for half-gates garbling (in the multi-instance setting)
- Indifferentiability of double length compression functions
- Improved indifferentiability security bound for the JH mode
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Block-cipher-based tree hashing
- Open problems in hash function security
This page was built for publication: Building indifferentiable compression functions from the PGV compression functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963372)
