Structural lower bounds on black-box constructions of pseudorandom functions
type: Item
instance of: scholarly article
title: Structural lower bounds on black-box constructions of pseudorandom functions
DOI: 10.1007/978-3-031-68388-6_16
author: Amos Beimel
author: Tal Malkin
author: Noam Mazor
publication date: 2024-12-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 65C10
zbMATH DE Number: 7958246
zbMATH Keywords: black-box complexity
zbMATH Keywords: oracle separation methodology
MaRDI profile type: Publication
cites work: Fast Pseudorandom Functions Based on Expander Graphs
cites work: Pseudorandom Functions and Lattices
cites work: Bounds on the Efficiency of Generic Cryptographic Constructions
cites work: One way functions and pseudorandom generators
cites work: Constant depth circuits, Fourier transform, and learnability
cites work: On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
cites work: On the complexity of constructing pseudorandom functions (especially when they don't exist)
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Synthesizers and their application to the parallel construction of pseudo-random functions
cites work: Pseudo-random functions and factoring (extended abstract)
cites work: Hardness vs randomness
cites work: Natural proofs
cites work: Theory of Cryptography
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 7958246