A fast multi-server, multi-block private information retrieval protocol

Luqin Wang, Trishank Karthik Kuppusamy, Yong Liu, Justin Cappos

Research output: Contribution to journalConference articlepeer-review


Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing the content of these queries to anyone. The traditional information- theoretic PIR schemes utilize multiple servers to download single data block, thus incur high communication overhead and high computation burden. In this paper, we develop an Information- theoretic multi-block PIR scheme that significantly reduce the client communication and computation overheads by download- ing multiple data blocks at a time. The design of k-safe binary matrices insures the information will not be revealed even if up to k servers collude. Our scheme has much lower overhead than the classic PIR schemes. The implementation of fast XOR operations benefits both servers and clients in reducing coding and decoding time. Our work demonstrates that multi-block PIR scheme can be optimized to simultaneously achieve low communication and computation overhead, comparable to even non-PIR systems, while maintaining a high level of privacy.

Original languageEnglish (US)
Article number7417246
JournalProceedings - IEEE Global Communications Conference, GLOBECOM
StatePublished - 2015
Event58th IEEE Global Communications Conference, GLOBECOM 2015 - San Diego, United States
Duration: Dec 6 2015Dec 10 2015

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing


Dive into the research topics of 'A fast multi-server, multi-block private information retrieval protocol'. Together they form a unique fingerprint.

Cite this