Candidate one-way functions based on expander graphs
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Cryptography in NC^0
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit constructions of linear-sized superconcentrators
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Hardness vs randomness
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- On the Security of Goldreich’s One-Way Function
- Pseudorandom Generators in Propositional Proof Complexity
- Public-key cryptography from different assumptions
- Ramanujan graphs
Cited in
(64)- Expander graphs based on GRH with an application to elliptic curve cryptography
- Cryptography with constant input locality
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Towards breaking the exponential barrier for general secret sharing
- Local expanders
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
- Minimizing locality of one-way functions via semi-private randomized encodings
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- On succinct arguments and witness encryption from groups
- On the fast algebraic immunity of threshold functions
- Expander-based cryptography meets natural proofs
- Counterexamples to new circular security assumptions underlying iO
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Asymptotically quasi-optimal cryptography
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Improved filter permutators for efficient FHE: better instances and implementations
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- Locally computable UOWHF with linear shrinkage
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- On the one-way function candidate proposed by Goldreich
- The complexity of inversion of explicit Goldreich's function by DPLL algorithms
- New Algorithms for Learning in Presence of Errors
- A candidate counterexample to the easy cylinders conjecture
- A dichotomy for local small-bias generators
- Fast pseudorandom functions based on expander graphs
- Boolean functions for homomorphic-friendly stream ciphers
- Cryptographic hardness of random local functions. Survey
- Conditional random fields, planted constraint satisfaction, and entropy concentration
- Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography
- On the security of Goldreich's one-way function
- Algebraic attacks against random local functions and their countermeasures
- Low-complexity cryptographic hash functions
- scientific article; zbMATH DE number 6866300 (Why is no real title available?)
- On the Power of Learning from k-Wise Queries
- The replica symmetric phase of random constraint satisfaction problems
- Randomness extraction in \(\mathsf{AC}^0\) and with small locality
- The Complexity of Public-Key Cryptography
- A Survey on some Applications of Graph Theory in Cryptography
- Expander-Based Cryptography Meets Natural Proofs
- Non-adaptive universal one-way hash functions from arbitrary one-way functions
- scientific article; zbMATH DE number 7758323 (Why is no real title available?)
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- 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
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Learning polynomial transformations via generalized tensor decompositions
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Towards topology-hiding computation from oblivious transfer
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Lossy cryptography from code-based assumptions
- A systematic study of sparse LWE
- Compressing unit-vector correlations via sparse pseudorandom generators
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Optimal inapproximability with universal factor graphs
- Random graph generation in context-free graph languages
- QuietOT: lightweight oblivious transfer with a public-key setup
- BitGC made (more) efficient
- Improved search-to-decision reduction for random local functions
- New constructions of pseudorandom codes
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
This page was built for publication: Candidate one-way functions based on expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088178)
