Главная
Study mode:
on
1
Intro
2
"Switching Lemma" for Random Permutation Function
3
Memory-Restricted Adversaries
4
Streaming Switching Lemma [JT'19]
5
New Streaming Switching Lemma
6
Reduction Attempt for Random Permutation Function
7
Improved Hybrid Argument
8
Permutation Dependence
9
UDISI- PDEP
10
The Full Hybrid Argument
11
Conclusions
Description:
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.

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

TheIACR
Add to list
0:00 / 0:00