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

DOI10.1007/978-3-030-57990-6_27MaRDI QIDQ2106668zbMATH OpenOpenAlexFDO

Authors 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

foundationsblack-box separationspseudorandom functions

Mathematics Subject Classification ID

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

Cited in

(1)

• scientific article; zbMATH DE number 7650434 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106668)