On the One-Way Function Candidate Proposed by Goldreich

No abstract is available for this paper.

• Publication year

  2014

• Venue

  ACM Transactions on Computation Theory

• Publication date

  2014-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/2633602
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the security of Goldreich’s one-way function

  2012cited by this paper
• The complexity of inverting explicit Goldreich’s function by DPLL algorithms

  2012cited by this paper
• Pseudorandom generators with long stretch and low locality from random local one-way functions

  2012cited by this paper
• The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms

  2011cited by this paper
• Algorithms and Computation

  2011cited by this paper
• Candidate One-Way Functions Based on Expander Graphs

  2011cited by this paper
• Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic

  2011cited by this paper
• Goldreich ’ s One-Way Function Candidate and Drunken Backtracking Algorithms

  2010cited by this paper
• Public-key cryptography from different assumptions

  2010cited by this paper
• Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms

  2010cited by this paper
• Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

  2009cited by this paper
• Erratum to: Theory of Cryptography

  2009cited by this paper
• On Pseudorandom Generators with Linear Stretch in NC0

  2006cited by this paper
• Effective Preprocessing in SAT Through Variable and Clause Elimination

  2005cited by this paper
• Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

  2004cited by this paper
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

  2004cited by this paper
• Cryptography in NC0

  2004cited by this paper
• An Extensible SAT-solver

  2003cited by this paper
• On Pseudorandom Generators in NC

  2001cited by this paper
• On pseudorandom generators in NC 0 ⋆

  2001cited by this paper
• An Experimental Evaluation of Goldreich ' s One-Way FunctionSaurabh

  2001cited by this paper
• Short proofs are narrow—resolution made simple

  2001cited by this paper
• Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle

  1999cited by this paper

• Structured-Seed Local Pseudorandom Generators and their Applications

  2024cites this paper
• Derandomization with Minimal Memory Footprint

  2023cites this paper
• Oblivious Transfer with Constant Computational Overhead

  2023cites this paper
• Sublinear-Communication Secure Multiparty Computation Does Not Require FHE

  2023cites this paper
• On the algebraic immunity—resiliency trade-off, implications for Goldreich’s pseudorandom generator

  2023cites this paper
• Hard satisfiable formulas for DPLL algorithms using heuristics with small memory

  2021cites this paper
• Secure Multi-Party Computation and Privacy

  2019cites this paper
• On the Concrete Security of Goldreich's Pseudorandom Generator

  2018cites this paper
• Expander-Based Cryptography Meets Natural Proofs

  2018cites this paper
• 18 : 2 Expander-Based Cryptography Meets Natural Proofs

  2018cites this paper
• Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions

  2017cites this paper
• PHASE TRANSITIONS IN RANDOM STRUCTURES

  2017cites this paper
• Homomorphic Secret Sharing: Optimizations and Applications

  2017cites this paper
• Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

  2016cites this paper
• Algebraic attacks against random local functions and their countermeasures

  2016cites this paper
• Fast Pseudorandom Functions Based on Expander Graphs

  2016cites this paper
• On linear-size pseudorandom generators and hardcore functions

  2013cites this paper
• Cryptographic Hardness of Random Local Functions

  2013influential citation
• Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms

  2010cites this paper