An adversary with S bits of memory obtains a stream of Q elements that are uniformly drawn from the set {1,2,...,N}, either with or without replacement. This corresponds to sampling Q elements using either a random function or a random permutation. The adversary’s goal is to distinguish between these two cases. This problem was first considered by Jaeger and Tessaro (EUROCRYPT 2019), which proved that the adversary’s advantage is upper bounded by √Q · S/N. Jaeger and Tessaro used this bound as a streaming switching lemma which allowed proving that known time-memory tradeoff attacks on several modes of operation (such as counter-mode) are optimal up to a factor of O(log N) if Q · S ≈ N. However, the bound’s proof assumed an unproven combinatorial conjecture. Moreover, if Q · S
CITATION STYLE
Dinur, I. (2020). On the Streaming Indistinguishability of a Random Permutation and a Random Function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12106 LNCS, pp. 433–460). Springer. https://doi.org/10.1007/978-3-030-45724-2_15
Mendeley helps you to discover research relevant for your work.