Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
From MaRDI portal
Publication:2104455
DOI10.1007/978-3-031-08896-4_17OpenAlexW4286759333MaRDI QIDQ2104455
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_17
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Probabilistic encryption
- Fast message franking: from invisible salamanders to encryptment
- Message franking via committing authenticated encryption
- Compactness of hashing modes and efficiency beyond Merkle tree
- Post-quantum EPID signatures from symmetric primitives
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- Keying Hash Functions for Message Authentication
- Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- Fast Software Encryption
- One Way Hash Functions and DES
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Collision-resistant and pseudorandom function based on Merkle-Damgård hash function