Amplifying Collision Resistance: A Complexity-Theoretic Treatment
From MaRDI portal
(Redirected from Publication:3612554)
Recommendations
- Information Security and Cryptology - ICISC 2003
- Some observations on the theory of cryptographic hash functions
- New Constructions for Secure Hash Functions
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Cited in
(15)- Query-complexity amplification for random oracles
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Parallel Hashing via List Recoverability
- Distributional collision resistance beyond one-way functions
- scientific article; zbMATH DE number 7286918 (Why is no real title available?)
- Multi-property Preserving Combiners for Hash Functions
- Robust multi-property combiners for hash functions
- Information Security and Cryptology - ICISC 2003
- Low-complexity cryptographic hash functions
- Random oracle combiners: Merkle-Damgård style
- Direct product hardness amplification
- Generic attacks on hash combiners
- Memoryless near-collisions via coding theory
- On derandomizing Yao's weak-to-strong OWF construction
This page was built for publication: Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612554)
