Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions

DOI10.1007/978-3-319-13039-2_6zbMath1344.94035OpenAlexW2111756630MaRDI QIDQ2945374

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Quantum algorithms for the \(k\)-XOR problem ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One way functions and pseudorandom generators
• From Non-adaptive to Adaptive Pseudorandom Functions
• Hardness Preserving Constructions of Pseudorandom Functions
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Equivalence of Uniform Key Agreement and Composition Insecurity
• Composition Implies Adaptive Security in Minicrypt
• Simple Constructions of Almost k-wise Independent Random Variables
• Hardness Preserving Reductions via Cuckoo Hashing
• Advances in Cryptology - EUROCRYPT 2004
• Composition Does Not Imply Adaptive Security

This page was built for publication: Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions