Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding

DOI10.1007/11935230_19zbMath1172.94567OpenAlexW1579585272MaRDI QIDQ5459085

Donghoon Chang, Sang Jin Lee, Mridul Nandi, Mordechai M. Yung

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_19

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles ⋮ LWDSA: light-weight digital signature algorithm for wireless sensor networks ⋮ Open problems in hash function security ⋮ Block-cipher-based tree hashing ⋮ Security of truncated permutation without initial value ⋮ A simple variant of the Merkle-Damgård scheme with a permutation ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ On the Indifferentiability of Fugue and Luffa ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ A synthetic indifferentiability analysis of some block-cipher-based hash functions ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ A Scheme to Base a Hash Function on a Block Cipher

This page was built for publication: Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding