Building indifferentiable compression functions from the PGV compression functions
From MaRDI portal
Publication:5963372
DOI10.1007/s10623-014-0020-zzbMath1355.94056OpenAlexW2012903828WikidataQ56933127 ScholiaQ56933127MaRDI QIDQ5963372
Nasour Bagheri, Lars R. Knudsen, Praveen Gauravaram
Publication date: 19 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-0020-z
Related Items (4)
Improved indifferentiability security bound for the JH mode ⋮ Open problems in hash function security ⋮ Block-cipher-based tree hashing ⋮ Better concrete security for half-gates garbling (in the multi-instance setting)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis of the blockcipher-based hash functions from PGV
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Security analysis of randomize-hash-then-sign digital signatures
- Careful with Composition: Limitations of the Indifferentiability Framework
- Blockcipher-Based Hashing Revisited
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Security Analysis of the Mode of JH Hash Function
- On the Indifferentiability of the Grøstl Hash Function
- Collisions and Near-Collisions for Reduced-Round Tiger
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Salvaging Merkle-Damgård for Practical Applications
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- Merkle-Damgård Revisited: How to Construct a Hash Function
- A Failure-Friendly Design Principle for Hash Functions
- On the Indifferentiability of the Sponge Construction
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Theory of Cryptography
This page was built for publication: Building indifferentiable compression functions from the PGV compression functions
