An Ω(n^{1/3}) lower bound for bilinear group based private information retrieval - Microsoft Research

Microsoft Translator |

An Ω(n^{1/3}) lower bound for bilinear group based private information retrieval

Alexander Razborov and Sergey Yekhanin
2007

GB_PIR.pdf

In Theory of Computing

Details

Type	Article
Pages	223-238
Volume	3
Number	1

Related Projects

Locally decodable codes

Related People

Sergey Yekhanin

Related Labs

Microsoft Research Silicon Valley

Share

> Publications > An Ω(n^{1/3}) lower bound for bilinear group based private information retrieval