On the Security of Goldreich’s One-Way Function

DOI10.1007/978-3-642-03685-9_30zbMath1255.94053OpenAlexW1764134075MaRDI QIDQ3638893

Youming Qiao, Andrej Bogdanov

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_30

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Locally computable UOWHF with linear shrinkage ⋮ 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 ⋮ Input locality and hardness amplification ⋮ On the security of Goldreich's one-way function ⋮ New Algorithms for Learning in Presence of Errors ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Candidate One-Way Functions Based on Expander Graphs

This page was built for publication: On the Security of Goldreich’s One-Way Function