On the query complexity of constructing PRFs from non-adaptive PRFs (Q2106668)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the query complexity of constructing PRFs from non-adaptive PRFs |
scientific article; zbMATH DE number 7633678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the query complexity of constructing PRFs from non-adaptive PRFs |
scientific article; zbMATH DE number 7633678 |
Statements
On the query complexity of constructing PRFs from non-adaptive PRFs (English)
0 references
16 December 2022
0 references
pseudorandom functions
0 references
black-box separations
0 references
foundations
0 references
