A Keyed Sponge Construction with Pseudorandomness in a Standard Model

Chang, Donghoon; Dworkin, Morris; Hong, Seokhie; Kelsey, John; Nandi, Mridul

Conference Paper

A Keyed Sponge Construction with Pseudorandomness in a Standard Model

Documentation

Published: March 22, 2012

Author(s)

Donghoon Chang, Morris Dworkin, Seokhie Hong, John Kelsey, Mridul Nandi

Conference

Name: The Third SHA-3 Candidate Conference
Dates: March 22-23, 2012
Location: Washington, DC, United States

Announcement

Abstract

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.

Keywords

sponge construction; pseudorandomness; indifferentiability

Control Families

None selected

Documentation

Publication:
None available

Supplemental Material:
None available

Document History:
03/22/12: Conference Paper (Final)