On the Streaming Indistinguishability of a Random Permutation and a Random Function

Explore a cryptographic analysis presented at Eurocrypt 2020 examining the streaming indistinguishability between random permutations and random functions. Delve into the "Switching Lemma" concept and its application to memory-restricted adversaries. Investigate the new Streaming Switching Lemma and its implications. Examine reduction attempts for random permutation functions and the improved hybrid argument technique. Analyze permutation dependence and the UDISI-PDEP concept. Conclude with a comprehensive overview of the full hybrid argument and its significance in cryptographic theory.

Intro
"Switching Lemma" for Random Permutation Function
Memory-Restricted Adversaries
Streaming Switching Lemma [JT'19]
New Streaming Switching Lemma
Reduction Attempt for Random Permutation Function
Improved Hybrid Argument
Permutation Dependence
UDISI- PDEP
The Full Hybrid Argument
Conclusions