From Non-adaptive to Adaptive Pseudorandom Functions

DOI10.1007/978-3-642-28914-9_20zbMath1303.94066OpenAlexW139073700MaRDI QIDQ2891494

Itay Berman, Iftach Haitner

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_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

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 ⋮ A combinatorial approach to quantum random functions ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ The magic of ELFs ⋮ From non-adaptive to adaptive pseudorandom functions

This page was built for publication: From Non-adaptive to Adaptive Pseudorandom Functions