From non-adaptive to adaptive pseudorandom functions
From MaRDI portal
Recommendations
- From non-adaptive to adaptive pseudorandom functions
- Efficient pseudorandom functions via on-the-fly adaptation
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Adaptively secure puncturable pseudorandom functions in the standard model
- Hardness preserving constructions of pseudorandom functions
Cited in
(19)- Quantum algorithms for the \(k\)-XOR problem
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- The magic of ELFs
- From non-adaptive to adaptive pseudorandom functions
- Hardness-preserving reductions via cuckoo hashing
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- On the adaptive security of MACs and PRFs
- A combinatorial approach to quantum random functions
- Two-message, oblivious evaluation of cryptographic functionalities
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- Multilinear pseudorandom functions
- Efficient pseudorandom functions via on-the-fly adaptation
- Equivalence of uniform key agreement and composition insecurity
- Hardness preserving reductions via cuckoo hashing
- Non-adaptive programmability of random oracle
- Composition Does Not Imply Adaptive Security
- Alternative security models for a pseudorandom function
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
This page was built for publication: From non-adaptive to adaptive pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891494)
