Security of Truncated Permutation Without Initial Value

Abstract

Indifferentiability is a powerful notion in cryptography. If a construction is proven to be indifferentiable from an ideal object, it can under certain assumptions instantiate that ideal object in higher-level constructions. Indifferentiability is a particularly useful model for cryptographic hash functions, and myriad results are known proving that a hash function behaves like a random oracle under the assumption that the underlying primitive (typically a compression function, a block cipher, or a permutation) is random. Recently, advances have been made in proving indifferentiability of one-way functions with fixed input length. One such example is truncation of a permutation. If one evaluates a random permutation on an input value concatenated with a fixed initial value, and truncates the output, one obtains a construction that is indifferentiable from a random function up to a certain bound (Dodis et al., FSE 2009; Choi et al., ASIACRYPT 2019). Security of this construction, however, is in part determined by the length of the initial value; omission of this fixed value yields an insecure construction.In this paper, we reconsider truncation of a permutation, and prove that the construction is indifferentiable from a random oracle, even if this fixed initial value is replaced by a randomized value. This randomized value may be the same for different evaluations of the construction, or freshly generated, up to the discretion of the adversary. The security level is the same as that of truncation with fixed initial value, up to collisions in the randomized value.We show that our construction has immediate implications in the context of parallel variable-length digest generation. In detail, we describe Cascade-MGF, that operates on top of any cryptographic hash function and uses the hash function output as randomized initial value in truncation. We demonstrate that Cascade-MGF compares favorably over earlier parallel variable-length digest generation constructions, namely Counter-MGF and Chained-MGF, in almost all settings.

Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks

“…, 2 ca , 2 cs queries. This result has been generalized to the case where the fixed prefix is randomized [GM22]. The developers of the PHOTON construction [GPP11] proposed to squeeze the digest at a rate r ′ > r (note that r ′ corresponds to r s in our case).…”

A New Construction Method for Keystream Generators

“…Some early works have presented loose bounds independently [34], [35]. Then, the cryptography community has realized that the Stam's results are quite tight and a number of works have verified his results [35], [36], [36], [38]. Gilboa et al have studied the question "How many queries are required to distinguish a T P P from a random function?"…”