Hardness Preserving Constructions of Pseudorandom Functions
From MaRDI portal
Publication:2891495
DOI10.1007/978-3-642-28914-9_21zbMath1303.94084OpenAlexW2158896582MaRDI QIDQ2891495
Aris Tentes, Krzysztof Pietrzak, Abhishek Jain
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_21
Related Items (7)
Quantum algorithms for the \(k\)-XOR problem ⋮ Efficient Pseudorandom Functions via On-the-Fly Adaptation ⋮ Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ A combinatorial approach to quantum random functions ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
This page was built for publication: Hardness Preserving Constructions of Pseudorandom Functions
