文章基本信息

标题：Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreichâs PRG
本地全文：下载
作者：Sumegha Garg ; Pravesh K. Kothari ; Ran Raz 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：176
页码：21:1-21:18
DOI：10.4230/LIPIcs.APPROX/RANDOM.2020.21
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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. Our first result applies to the problem of distinguishing the uniform distribution on {0,1}â¿ from uniform distribution on some unknown linear subspace of {0,1}â¿. As a specific corollary, we show that any algorithm that distinguishes between uniform distribution on {0,1}â¿ and uniform distribution on an n/2-dimensional linear subspace of {0,1}â¿ with non-negligible advantage needs 2^Î©(n) samples or Î©(nÂ²) memory (tight up to constants in the exponent). Our second result applies to distinguishing outputs of Goldreichâs local pseudorandom generator from the uniform distribution on the output domain. Specifically, Goldreichâs pseudorandom generator G fixes a predicate P:{0,1}^k â' {0,1} and a collection of subsets Sâ,, Sâ,,, â¦, S_m âS [n] of size k. For any seed x â^^ {0,1}â¿, it outputs P(x_Sâ,), P(x_Sâ,,), â¦, P(x_{S_m}) where x_{S_i} is the projection of x to the coordinates in S_i. We prove that whenever P is t-resilient (all non-zero Fourier coefficients of (-1)^P are of degree t or higher), then no algorithm, with < n^Îµ memory, can distinguish the output of G from the uniform distribution on {0,1}^m with a large inverse polynomial advantage, for stretch m â¤ (n/t) ^{(1-Îµ)/36 â<. t} (barring some restrictions on k). The lower bound holds in the streaming model where at each time step i, S_i âS [n] is a randomly chosen (ordered) subset of size k and the distinguisher sees either P(x_{S_i}) or a uniformly random bit along with S_i. An important implication of our second result is the security of Goldreichâs generator with super linear stretch (in the streaming model), against memory-bounded adversaries, whenever the predicate P satisfies the necessary condition of t-resiliency identified in various prior works. Our proof builds on the recently developed machinery for proving time-space trade-offs (Raz 2016 and follow-ups). Our key technical contribution is to adapt this machinery to work for distinguishing problems in contrast to prior works on similar results for search/learning problems.
关键词：memory-sample tradeoffs; bounded storage cryptography; Goldreichâs local PRG; distinguishing problems; refuting CSPs