Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
From MaRDI portal
Publication:2945374
DOI10.1007/978-3-319-13039-2_6zbMATH Open1344.94035OpenAlexW2111756630MaRDI QIDQ2945374FDOQ2945374
Authors: Nishanth Chandran, Sanjam Garg 
Publication date: 10 September 2015
Published in: Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13039-2_6
Recommendations
- Hardness preserving constructions of pseudorandom functions
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- From non-adaptive to adaptive pseudorandom functions
- Efficient pseudorandom functions via on-the-fly adaptation
- Performance improvement for the GGM-construction of pseudorandom functions
Cites Work
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Simple Constructions of Almost k-wise Independent Random Variables
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- One way functions and pseudorandom generators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- From non-adaptive to adaptive pseudorandom functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hardness preserving constructions of pseudorandom functions
- Hardness preserving reductions via cuckoo hashing
- Equivalence of uniform key agreement and composition insecurity
- Composition Implies Adaptive Security in Minicrypt
- Advances in Cryptology - EUROCRYPT 2004
- Composition Does Not Imply Adaptive Security
Cited In (8)
- Quantum algorithms for the \(k\)-XOR problem
- Performance improvement for the GGM-construction of pseudorandom functions
- Hardness preserving constructions of pseudorandom functions
- Hardness preserving reductions via cuckoo hashing
- Hardness-preserving reductions via cuckoo hashing
- Structural lower bounds on black-box constructions of pseudorandom functions
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
This page was built for publication: Balancing output length and query bound in 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 Q2945374)
