Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG

Garg Sumegha
Garg Sumegha
Kothari Pravesh K.
Kothari Pravesh K.

APPROX/RANDOM, 2020.

Cited by: 0|Bibtex|Views10|Links
EI

Abstract:

In this work, we establish lower-bounds against memory bounded algorithms for distinguishing between natural pairs of related distributions from samples that arrive in a streaming setting. In our first result, we show that any algorithm that distinguishes between uniform distribution on $\{0,1\}^n$ and uniform distribution on an $n/2$...More

Code:

Data:

Your rating :
0

 

Tags
Comments