{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:51:08Z","timestamp":1773676268627,"version":"3.50.1"},"reference-count":0,"publisher":"Universitatsbibliothek der Ruhr-Universitat Bochum","issue":"1","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ToSC"],"abstract":"<jats:p>The sponge construction is subject to an indifferentiability security bound of c\/2 bits, where c denotes the capacity. For a given b-bit permutation, the sponge construction allows sacrificing the rate r = b \u2212 c to achieve the theoretically optimal security bound of (b\u22121)\/2 bits. However, the efficient construction of a permutationbased hash with b\/2-bit security remains an open problem.In this paper, we analyze the porifera family, a class of generalized sponge functions including existing designs such as JH and FP. We introduce the t-way chosen multitarget (t-CMT) preimage resistance and propose the Universal San Mai Attack (USMA) to target this property. We reduce the indifferentiability bound for both JH and FP to b\/3 bits, which is lower than previously assumed.Furthermore, we classify the porifera family and prove that, under a restriction on the linear layer complexity, there exists a unique design, named VFB, that achieves the optimal security bound of approximately b\/2 bits. Although it requires r \u2265 c and a distinct finalization, it provides higher throughput for high-security parameters. For instance, using a 1600-bit permutation, VFB achieves 512-bit security at a rate of 1064 bits, exceeding the rate of Keccak-512.<\/jats:p>","DOI":"10.46586\/tosc.v2026.i1.31-75","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:18:34Z","timestamp":1773670714000},"page":"31-75","source":"Crossref","is-referenced-by-count":0,"title":["Indifferentiability of the Sponge Hash Family: New Attacks and the Optimal Construction"],"prefix":"10.46586","volume":"2026","author":[{"given":"Hongli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changlun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengmei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25480","published-online":{"date-parts":[[2026,3,16]]},"container-title":["IACR Transactions on Symmetric Cryptology"],"original-title":[],"link":[{"URL":"https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/download\/12778\/12467","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/download\/12778\/12467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:18:34Z","timestamp":1773670714000},"score":1,"resource":{"primary":{"URL":"https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/12778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,3,16]]}},"URL":"https:\/\/doi.org\/10.46586\/tosc.v2026.i1.31-75","relation":{},"ISSN":["2519-173X"],"issn-type":[{"value":"2519-173X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]}}}