An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval

Alexander A. Razborov, Sergey Yekhanin. An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval. Electronic Colloquium on Computational Complexity (ECCC), 13(050), 2006. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: