Cryptographic hardness of random local functions. Survey (Q332271): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral technique for coloring random 3-colorable graphs (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptography from different assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy for Local Small-Bias Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally private randomizing polynomials and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Computable UOWHF with Linear Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation resistant predicates from pairwise independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of Squares Lower Bounds from Pairwise Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection of relevant features and examples in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for Read-Once Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of Goldreich's one-way function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input Locality and Hardness Amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic independence fools <i>AC</i> <sup>0</sup> circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for Random k-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the One-Way Function Candidate Proposed by Goldreich / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Fools Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between average case complexity and approximation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Random Satisfiability Problems with Planted Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral technique for random satisfiable 3CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 2-CSP allows nontrivial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Pseudorandom Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ε‐biased generators in NC<sup>0</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of \(D\) small-bias generators fools polynomials of degree \(D\) / rank
 
Normal rank

Latest revision as of 20:34, 12 July 2024

scientific article
Language Label Description Also known as
English
Cryptographic hardness of random local functions. Survey
scientific article

    Statements

    Cryptographic hardness of random local functions. Survey (English)
    0 references
    0 references
    28 October 2016
    0 references
    constant-depth circuits
    0 references
    cryptography
    0 references
    hash functions
    0 references
    local functions
    0 references
    NC0
    0 references
    one-way functions
    0 references
    pseudorandom generators
    0 references
    public-key encryption
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers