Pseudorandom generators with long stretch and low locality from random local one-way functions
From MaRDI portal
Publication:5415517
DOI10.1145/2213977.2214050zbMath1286.65007OpenAlexW2045395359MaRDI QIDQ5415517
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214050
Related Items (10)
Improved filter permutators for efficient FHE: better instances and implementations ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Oblivious transfer with constant computational overhead ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ On the computational complexity of measuring global stability of banking networks ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ The Complexity of Public-Key Cryptography
This page was built for publication: Pseudorandom generators with long stretch and low locality from random local one-way functions