A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2133245646 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 5242868
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval |
scientific article; zbMATH DE number 5242868 |
Statements
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (English)
0 references
5 March 2008
0 references
