@article{Dobraunig_Mennink_2020, title={Security of the Suffix Keyed Sponge}, volume={2019}, url={https://tosc.iacr.org/index.php/ToSC/article/view/8463}, DOI={10.13154/tosc.v2019.i4.223-248}, abstractNote={<p>We formalize and analyze the general suffix keyed sponge construction, a pseudorandom function built on top of a cryptographic permutation. The construction hashes its data using the (keyless) sponge construction, transforms part of the state using the secret key, and generates the tag from the output of a final permutation call. In its simplest form, if the key and tag size are at most the rate of the sponge, one can see the suffix keyed sponge as a simple sponge function evaluation whose input is the plaintext appended with the key. The suffix keyed sponge is, however, much more general: the key and tag size may exceed the rate without any need to make extra permutation calls. We prove that the suffix keyed sponge construction achieves birthday-bound PRF security in the capacity, even if key and tag size exceed the rate. Furthermore, we prove that if the absorption of the key into the state happens in a leakage resilient manner, the suffix keyed sponge itself is leakage resilient as well. Our findings show that the suffix keyed sponge compares favorably with the hash-then-MAC construction. For instance, to reach a security level of <em>k</em> bits, the side-channel protected component in the suffix keyed sponge just needs to process <em>k</em> bits of input besides the key, whereas schemes following the hash-then-MAC construction need a side-channel protected MAC function that processes 2<em>k</em> bits of input besides the key. Moreover, even if we just consider black-box attacks, the MAC function in a hash-then-MAC scheme needs to be cryptographically strong whereas in the suffix keyed sponge the key may be absorbed by a simple XOR. The security proofs are performed using the H-coefficient technique, and make effective use of the multicollision limit function results of Daemen et al. (ASIACRYPT 2017), both for arguing that state manipulation larger than the rate is tolerated after key processing and for upper bounding the amount of leakage an attacker may gain about the secret key.</p>}, number={4}, journal={IACR Transactions on Symmetric Cryptology}, author={Dobraunig, Christoph and Mennink, Bart}, year={2020}, month={Jan.}, pages={223–248} }