Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs

M Braverman, G Cohen, S Garg - SIAM Journal on Computing, 2019 - SIAM
Nisan Combinatorica, 12 (1992), pp. 449--461 constructed a pseudorandom generator for
length n, width n read-once branching programs (ROBPs) with error ε and seed length …

Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries

S Tessaro, A Thiruvengadam - Theory of Cryptography Conference, 2018 - Springer
We initiate the study of symmetric encryption in a regime where the memory of the adversary
is bounded. For a block cipher with n-bit blocks, we present modes of operation for …

Bounded independence plus noise fools products

E Haramaty, CH Lee, E Viola - SIAM Journal on Computing, 2018 - SIAM
Let D be a b-wise independent distribution over {0,1\}^m. Let E be the “noise” distribution
over {0,1\}^m where the bits are independent and each bit is 1 with probability η/2. We study …

Hitting sets with near-optimal error for read-once branching programs

M Braverman, G Cohen, S Garg - Proceedings of the 50th Annual ACM …, 2018 - dl.acm.org
Nisan (Combinatorica'92) constructed a pseudorandom generator for length n, width n read-
once branching programs (ROBPs) with error ε and seed length O (log2 n+ log n· log (1/ε)) …

Pseudorandom bits for oblivious branching programs

R Gurjar, BL Volk - ACM Transactions on Computation Theory (TOCT), 2020 - dl.acm.org
We construct a pseudorandom generator that fools known-order read-k oblivious branching
programs and, more generally, any linear length oblivious branching program. For …

[PDF][PDF] Bounded Independence Plus Noise

CH Lee - 2019 - repository.library.northeastern.edu
The theory of pseudorandomness studies explicit constructions of objects that appear
random to restricted classes of tests. It has numerous connections to computer science and …

[引用][C] Identity Testing and Lower Bounds in Arithmetic Complexity

BL Volk - 2018 - Tel Aviv University, Israel