Sandwich Construction for Keyed Sponges: Independence Between Capacity and Online Queries

Conference paper

DOI: 10.1007/978-3-319-48965-0_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10052)
Cite this paper as:
Naito Y. (2016) Sandwich Construction for Keyed Sponges: Independence Between Capacity and Online Queries. In: Foresti S., Persiano G. (eds) Cryptology and Network Security. CANS 2016. Lecture Notes in Computer Science, vol 10052. Springer, Cham

Abstract

We study the pseudo-random function (PRF) security of keyed sponges that use a sponge function with extendable outputs in a black-box way. “Capacity” is a parameter of a keyed sponge that usually defines a dominant term in the PRF-bound. The previous works have improved the capacity term in the PRF-bound of the “prefix” keyed sponge, where the key is prepended to an input message, and then the resultant value is inputted into the sponge function. A tight bound for the capacity term was given by Naito and Yasuda (FSE 2016): \((qQ+q^2)/2^c\) where c is the capacity, q is the number of online queries and Q is the number of offline queries. Thus the following question is naturally arisen: can we construct a keyed sponge with beyond the\((q^2+qQ)/2^c\)bound security?

In this paper, we consider the “sandwich” keyed sponge, where the key is both prepended and appended to an input message, and then the resultant value is inputted into the sponge function. We prove that the capacity term becomes \(rQ/2^c\) for the rate r, which is usually \(r \ll q\) and \(r \ll Q\). Therefore, by the sandwich construction, the dependence between the capacity term and the number of online queries can be removed.

Keywords

PRF Keyed sponge Sandwich construction Game playing Coefficient H technique Stirling’s approximation 

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Mitsubishi Electric CorporationKanagawaJapan

Personalised recommendations