Pages that link to "Item:Q3088178"

The following pages link to Candidate One-Way Functions Based on Expander Graphs (Q3088178):

Displaying 50 items.

• A dichotomy for local small-bias generators (Q315550) (← links)
• Cryptographic hardness of random local functions. Survey (Q332271) (← links)
• On the security of Goldreich's one-way function (Q430847) (← links)
• Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (Q897709) (← links)
• Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
• Cryptography with constant input locality (Q1037233) (← links)
• Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• Local expanders (Q1653336) (← links)
• Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
• Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
• Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• On the fast algebraic immunity of threshold functions (Q2121004) (← links)
• Expander-based cryptography meets natural proofs (Q2125080) (← links)
• Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) (← links)
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
• Improved filter permutators for efficient FHE: better instances and implementations (Q2179380) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• On the one-way function candidate proposed by Goldreich (Q2828220) (← links)
• The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms (Q3007623) (← links)
• New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
• A Candidate Counterexample to the Easy Cylinders Conjecture (Q3088184) (← links)
• Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
• Boolean Functions for Homomorphic-Friendly Stream Ciphers (Q3294876) (← links)
• Conditional random fields, planted constraint satisfaction, and entropy concentration (Q3467515) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
• (Q4638056) (← links)
• (Q4638058) (← links)
• On the Power of Learning from k-Wise Queries (Q4638095) (← links)
• The replica symmetric phase of random constraint satisfaction problems (Q4993097) (← links)
• (Q5009532) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)
• A Survey on some Applications of Graph Theory in Cryptography (Q5069665) (← links)
• Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
• (Q6062142) (← links)
• Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher (Q6135425) (← links)
• Public-key encryption, local pseudorandom generators, and the low-degree method (Q6581791) (← links)
• Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
• The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm (Q6623298) (← links)
• Lossy cryptography from code-based assumptions (Q6652889) (← links)
• A systematic study of sparse LWE (Q6652897) (← links)