The sponge construction, designed by Bertoni, Daemen, Peeters, and Asscheis, is the framework for hash functions such as Keccak, PHOTON, Quark, and spongent. The designers give a keyed sponge construction by prepending the message with key and prove a bound on its pseudorandomness in the ideal permutation model . In this paper we give a different keyed sponge construction that is based on the Even-Mansour permutation and prove its pseudorandomness in the standard model.
Proceedings Title: N/A
Conference Dates: March 22-23, 2012
Conference Location: Washington, DC
Conference Title: The Third SHA-3 Candidate Conference
Pub Type: Conferences
indifferentiability, pseudorandomness, sponge construction