Hardness Preserving Reductions via Cuckoo Hashing
From MaRDI portal
Publication:4910270
DOI10.1007/978-3-642-36594-2_3zbMath1297.94049OpenAlexW1794707733MaRDI QIDQ4910270
Moni Naor, Itay Berman, Ilan Komargodski, Iftach Haitner
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_3
Related Items (9)
Quantum algorithms for the \(k\)-XOR problem ⋮ Bloom Filters in Adversarial Environments ⋮ 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 ⋮ From non-adaptive to adaptive pseudorandom functions ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication: Hardness Preserving Reductions via Cuckoo Hashing
