Balancing output length and query bound in hardness preserving constructions of pseudorandom functions

DOI10.1007/978-3-319-13039-2_6MaRDI QIDQ2945374zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 4020467 (Why is no real title available?)
• scientific article; zbMATH DE number 4035726 (Why is no real title available?)
• scientific article; zbMATH DE number 1261819 (Why is no real title available?)
• scientific article; zbMATH DE number 861531 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Composition Does Not Imply Adaptive Security
• Composition Implies Adaptive Security in Minicrypt
• Equivalence of uniform key agreement and composition insecurity
• From non-adaptive to adaptive pseudorandom functions
• Hardness preserving constructions of pseudorandom functions
• Hardness preserving reductions via cuckoo hashing
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• One way functions and pseudorandom generators
• Simple Constructions of Almost k-wise Independent Random Variables
• Small-Bias Probability Spaces: Efficient Constructions and Applications

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
• On the complexity of constructing pseudorandom functions (especially when they don't exist)
• Structural lower bounds on black-box constructions of pseudorandom functions
• 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)