Hardness preserving constructions of pseudorandom functions
From MaRDI portal
Recommendations
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Performance improvement for the GGM-construction of pseudorandom functions
- scientific article; zbMATH DE number 1302860
- On linear-size pseudorandom generators and hardcore functions
Cited in
(18)- Quantum algorithms for the \(k\)-XOR problem
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- From non-adaptive to adaptive pseudorandom functions
- Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
- Multilinear pseudorandom functions
- Fast pseudorandom functions based on expander graphs
- Hardness preserving reductions via cuckoo hashing
- Efficient pseudorandom functions via on-the-fly adaptation
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- Pseudorandom functions: three decades later
- Hardness-preserving reductions via cuckoo hashing
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Structural lower bounds on black-box constructions of pseudorandom functions
- A combinatorial approach to quantum random functions
- Building a pseudorandom function using a Naor-Reingold type construction
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- scientific article; zbMATH DE number 1583802 (Why is no real title available?)
This page was built for publication: Hardness preserving constructions of pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891495)
