Fast pseudorandom functions based on expander graphs
From MaRDI portal
Recommendations
- Hardness preserving constructions of pseudorandom functions
- On linear-size pseudorandom generators and hardcore functions
- On linear-size pseudorandom generators and hardcore functions
- Cryptographic hash functions from sequences of lifted Paley graphs
- Pseudorandom generators with long stretch and low locality from random local one-way functions
Cites work
- A dichotomy for local small-bias generators
- A Pseudorandom Generator from any One-way Function
- A theory of the learnable
- Algebraic attacks against random local functions and their countermeasures
- Algorithms for exponentiation in finite fields
- An Almost m-wise Independent Random Permutation of the Cube
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Bounds to Complexities of Networks for Sorting and for Switching
- Candidate one-way functions based on expander graphs
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Constant depth circuits, Fourier transform, and learnability
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Constructing pseudo-random permutations with a prescribed structure
- Cryptographic hardness for learning intersections of halfspaces
- Cryptographic hardness of distribution-specific learning
- Cryptographic hardness of random local functions -- survey
- Cryptography with constant computational overhead
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- Fast pseudorandom functions based on expander graphs
- From average case complexity to improper learning complexity
- From non-adaptive to adaptive pseudorandom functions
- Functional encryption with bounded collusions via multi-party computation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 1261819 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- Input locality and hardness amplification
- Natural proofs
- On the complexity of random satisfiability problems with planted solutions (extended abstract)
- On the one-way function candidate proposed by Goldreich
- On the security of Goldreich's one-way function
- Parallel Prefix Computation
- Pseudo-random functions and factoring (extended abstract)
- Pseudorandom functions and lattices
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Relations Among Complexity Measures
- Simple permutations mix even better
- Simple permutations mix well
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Substitution-permutation networks, pseudorandom functions, and natural proofs
Cited in
(17)- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast scramblers, horizons and expander graphs
- Expander-based cryptography meets natural proofs
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Candidate one-way functions based on expander graphs
- Fast pseudorandom functions based on expander graphs
- Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography
- Fast Time-Recursive Block Correlators for Pseudorandom Sequences
- Keyed hash function from large girth expander graphs
- Expander-Based Cryptography Meets Natural Proofs
- Fast public-key silent OT and more from constrained Naor-Reingold
- Structural lower bounds on black-box constructions of pseudorandom functions
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- QuietOT: lightweight oblivious transfer with a public-key setup
- Fast pseudorandom correlation functions from sparse LPN
- BitGC made (more) efficient
- Structured-seed local pseudorandom generators and their applications
This page was built for publication: Fast pseudorandom functions based on expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179351)
