A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520): Difference between revisions
From MaRDI portal
Latest revision as of 18:19, 27 June 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
0 references
