Block-cipher-based tree hashing
From MaRDI portal
Publication:6111546
DOI10.1007/978-3-031-15985-5_8OpenAlexW4312556153MaRDI QIDQ6111546
Publication date: 7 July 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_8
Related Items (2)
Security of truncated permutation without initial value ⋮ Revisiting the indifferentiability of the sum of permutations
Cites Work
- Unnamed Item
- Unnamed Item
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Compactness of hashing modes and efficiency beyond Merkle tree
- Indifferentiability of truncated random permutations
- On the XOR of Multiple Random Permutations
- Indifferentiability of Double Length Compression Functions
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- Sponge-Based Pseudo-Random Number Generators
- The “Coefficients H” Technique
- Indifferentiability of the Sum of Random Permutations Toward Optimal Security
- Tight Security Bounds for Key-Alternating Ciphers
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- Theory of Cryptography
- Building indifferentiable compression functions from the PGV compression functions
- One Way Hash Functions and DES
This page was built for publication: Block-cipher-based tree hashing
