Robust Multi-property Combiners for Hash Functions Revisited
From MaRDI portal
Publication:3519540
DOI10.1007/978-3-540-70583-3_53zbMath1155.94366OpenAlexW2140331728MaRDI QIDQ3519540
Krzysztof Pietrzak, Anja Lehmann, Marc Fischlin
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/13783
Related Items (5)
FO-like combiners and hybrid post-quantum cryptography ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Generic attacks on hash combiners ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ Robust multi-property combiners for hash functions
Cites Work
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Multi-property Preserving Combiners for Hash Functions
- Topics in Cryptology – CT-RSA 2005
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- Theory of Cryptography
This page was built for publication: Robust Multi-property Combiners for Hash Functions Revisited
