Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
From MaRDI portal
Publication:5428826
DOI10.1007/978-3-540-73420-8_36zbMath1171.94339OpenAlexW2122775562MaRDI QIDQ5428826
Thomas Ristenpart, Mihir Bellare
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_36
Related Items (15)
A simple variant of the Merkle-Damgård scheme with a permutation ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Boosting Merkle-Damgård Hashing for Message Authentication ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ How to Fill Up Merkle-Damgård Hash Functions ⋮ Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512 ⋮ Multi-property Preserving Combiners for Hash Functions ⋮ On chosen target forced prefix preimage resistance ⋮ Robust multi-property combiners for hash functions ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders ⋮ A Three-Property-Secure Hash Function
This page was built for publication: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
