Public Key Cryptography – PKC 2010

Volume 6056 of the series Lecture Notes in Computer Science pp 107-123

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate

  • Jens GrothAffiliated withUniversity College London
  • , Aggelos KiayiasAffiliated withDepartment of Informatics, University of Athens
  • , Helger LipmaaAffiliated withCybernetica ASTallinn University


A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains oblivious to the index of the record retrieved while the overall communication between the two parties is smaller than the database size. This problem has been extensively studied and is known as computationally private information retrieval (CPIR). In this work we consider a natural extension of this problem: a multi-query CPIR protocol allows a client to extract m records of a database containing n ℓ-bit records. We give an information-theoretic lower bound on the communication of any multi-query information retrieval protocol. We then design an efficient non-trivial multi-query CPIR protocol that matches this lower bound. This means we settle the multi-query CPIR problem optimally up to a constant factor.


Computationally private information retrieval multi-query CPIR lower bound on communication