Login / Signup

) Lower Bound for Bilinear Group Based Private Information Retrieval.

Alexander A. RazborovSergey Yekhanin
Published in: FOCS (2006)
Keyphrases
  • lower bound
  • upper bound
  • private information retrieval
  • branch and bound algorithm
  • optimal solution
  • objective function
  • database
  • low cost
  • cost effective
  • privacy preserving
  • cryptographic protocols