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

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

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)

• Title not available (Why is that?)

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)