Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

90

ECCC
2006

53views more ECCC 2006»

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

15 years 3 months ago

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

Download theoryofcomputing.org

Alexander A. Razborov, Sergey Yekhanin

Real-time Traffic

ECCC 2006 |

claim paper

Related Content

» Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups

» Communication Complexity in Algebraic TwoParty Protocols

» PublicKey Encryption in the BoundedRetrieval Model

» Digital Video and Hypermedia Based New Services for Working on Patrimonial Archives

» Mapping Lexical Entries in a Verbs Database to WordNet Senses

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ECCC
Authors	Alexander A. Razborov, Sergey Yekhanin

Comments (0)