Collision-resistant and pseudorandom function based on Merkle-Damgård hash function

DOI10.1007/978-3-031-08896-4_17OpenAlexW4286759333MaRDI QIDQ2104455FDOQ2104455

Authors: Shouichi Hirose 

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_17

zbMATH Keywords

hash functionrelated-key attackprovable securitypseudorandom functioncollision resistance

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Cites Work

• Probabilistic encryption
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• Keying hash functions for message authentication
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• One Way Hash Functions and DES
• OMAC: one-key CBC MAC.
• Title not available (Why is that?)
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• Fast message franking: from invisible salamanders to encryptment
• Message franking via committing authenticated encryption
• Post-quantum EPID signatures from symmetric primitives
• Compactness of hashing modes and efficiency beyond Merkle tree
• Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512

Cited In (4)

• Merkle-Damgård Revisited: How to Construct a Hash Function
• Parameter-hiding order-revealing encryption without pairings
• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• How to Build a Hash Function from Any Collision-Resistant Function

This page was built for publication: Collision-resistant and pseudorandom function based on Merkle-Damgård hash function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104455)