Paper 2024/911
Generalized Indifferentiable Sponge and its Application to Polygon Miden VM
Abstract
Cryptographic hash functions are said to be the work-horses of modern cryptography. One of the strongest approaches to assess a cryptographic hash function's security is indifferentiability. Informally, indifferentiability measures to what degree the function resembles a random oracle when instantiated with an ideal underlying primitive. However, proving the indifferentiability security of hash functions has been challenging due to complex simulator designs and proof arguments. The Sponge construction is one of the prevalent hashing method used in various systems. The Sponge has been shown to be indifferentiable from a random oracle when initialized with a random permutation.
In this work, we first introduce
Note: Added an application section. Updated the related works.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- SpongeGSpongeSponge2Hashing ModeAlgebraicMiden VMIndifferentiabilityRandom OracleGeneric Attacks
- Contact author(s)
-
tomer @ 3milabs tech
amitsingh bhati @ esat kuleuven be - History
- 2024-07-11: last of 2 revisions
- 2024-06-07: received
- See all versions
- Short URL
- https://ia.cr/2024/911
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/911, author = {Tomer Ashur and Amit Singh Bhati}, title = {Generalized Indifferentiable Sponge and its Application to Polygon Miden {VM}}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/911}, year = {2024}, url = {https://eprint.iacr.org/2024/911} }