Permutation-Based Hashing Beyond the Birthday Bound
Abstract: It is known that the sponge construction is tightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity. In particular, it cannot provide generic security better than half of the underlying permutation size. In this paper, we aim to achieve hash function security beating this barrier. We present a hashing mode based on two b-bit permutations named the double sponge. The double sponge can be seen as the sponge embedded within the double block length hashing paradigm, making two permutation calls in parallel interleaved with an efficient mixing function. Similarly to the sponge, the permutation size is split as b = r+c, and the underlying compression function absorbs r bits at a time. We prove that the double sponge is indifferentiable from a random oracle up to around 22c/3 queries. This means that the double sponge achieves security beyond the birthday bound in the capacity. In addition, if c > 3b/4, the double sponge beats the birthday bound in.... https://tosc.iacr.org/index.php/ToSC/article/view/11402
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Permutation-Based Hashing Beyond the Birthday Bound ; volume:2024 ; number:1 ; year:2024
IACR transactions on symmetric cryptology ; 2024, Heft 1 (2024)
- Creator
-
Lefevre, Charlotte
Mennink, Bart
- DOI
-
10.46586/tosc.v2024.i1.71-113
- URN
-
urn:nbn:de:101:1-2024032017560953064389
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lefevre, Charlotte
- Mennink, Bart
Other Objects (12)
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Permutation-Based Hash Chains with Application to Password Hashing
Lightweight AEAD and hashing using the sparkle permutation family
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security
Beyond-birthday-bound secure cryptographic permutations from ideal ciphers with long keys
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
On beyond-birthday-bound security: revisiting the development of ISO/IEC 9797-1 MACs
Load thresholds for cuckoo hashing with double hashing
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Permutation-Based Hash Chains with Application to Password Hashing
Lightweight AEAD and hashing using the sparkle permutation family
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security
Beyond-birthday-bound secure cryptographic permutations from ideal ciphers with long keys
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
On beyond-birthday-bound security: revisiting the development of ISO/IEC 9797-1 MACs
Load thresholds for cuckoo hashing with double hashing
Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Permutation-Based Hash Chains with Application to Password Hashing
Lightweight AEAD and hashing using the sparkle permutation family
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security
Beyond-birthday-bound secure cryptographic permutations from ideal ciphers with long keys
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
On beyond-birthday-bound security: revisiting the development of ISO/IEC 9797-1 MACs