The query-complexity of preprocessing attacks (Q6145923): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4385654448 / rank | |||
Normal rank | |||
Revision as of 09:55, 30 July 2024
scientific article; zbMATH DE number 7799231
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The query-complexity of preprocessing attacks |
scientific article; zbMATH DE number 7799231 |
Statements
The query-complexity of preprocessing attacks (English)
0 references
2 February 2024
0 references
offline-online time trade-offs
0 references
time-complexity
0 references
