On the query complexity of constructing PRFs from non-adaptive PRFs

DOI10.1007/978-3-030-57990-6_27OpenAlexW3083300580MaRDI QIDQ2106668

Pratik Soni, Stefano Tessaro

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_27

zbMATH Keywords

foundationspseudorandom functionsblack-box separations

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

This page was built for publication: On the query complexity of constructing PRFs from non-adaptive PRFs