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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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)
Title of host publication2015 IEEE Global Communications Conference, GLOBECOM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479959525
DOIs
StatePublished - Feb 23 2016
Event58th IEEE Global Communications Conference, GLOBECOM 2015 - San Diego, United States
Duration: Dec 6 2015Dec 10 2015

Other

Other58th IEEE Global Communications Conference, GLOBECOM 2015
CountryUnited States
CitySan Diego
Period12/6/1512/10/15

Fingerprint

Information retrieval
information retrieval
Servers
Network protocols
Communication
communication
Information retrieval systems
Decoding
privacy
coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Wang, L., Kuppusamy, T. K., Liu, Y., & Cappos, J. (2016). A fast multi-server, multi-block private information retrieval protocol. In 2015 IEEE Global Communications Conference, GLOBECOM 2015 [7417246] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2014.7417246

A fast multi-server, multi-block private information retrieval protocol. / Wang, Luqin; Kuppusamy, Trishank Karthik; Liu, Yong; Cappos, Justin.

2015 IEEE Global Communications Conference, GLOBECOM 2015. Institute of Electrical and Electronics Engineers Inc., 2016. 7417246.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, L, Kuppusamy, TK, Liu, Y & Cappos, J 2016, A fast multi-server, multi-block private information retrieval protocol. in 2015 IEEE Global Communications Conference, GLOBECOM 2015., 7417246, Institute of Electrical and Electronics Engineers Inc., 58th IEEE Global Communications Conference, GLOBECOM 2015, San Diego, United States, 12/6/15. https://doi.org/10.1109/GLOCOM.2014.7417246
Wang L, Kuppusamy TK, Liu Y, Cappos J. A fast multi-server, multi-block private information retrieval protocol. In 2015 IEEE Global Communications Conference, GLOBECOM 2015. Institute of Electrical and Electronics Engineers Inc. 2016. 7417246 https://doi.org/10.1109/GLOCOM.2014.7417246
Wang, Luqin ; Kuppusamy, Trishank Karthik ; Liu, Yong ; Cappos, Justin. / A fast multi-server, multi-block private information retrieval protocol. 2015 IEEE Global Communications Conference, GLOBECOM 2015. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{e8515593d6ab4bfc969d94cd12f6e1b5,
title = "A fast multi-server, multi-block private information retrieval protocol",
abstract = "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.",
author = "Luqin Wang and Kuppusamy, {Trishank Karthik} and Yong Liu and Justin Cappos",
year = "2016",
month = "2",
day = "23",
doi = "10.1109/GLOCOM.2014.7417246",
language = "English (US)",
booktitle = "2015 IEEE Global Communications Conference, GLOBECOM 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

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

AU - Wang, Luqin

AU - Kuppusamy, Trishank Karthik

AU - Liu, Yong

AU - Cappos, Justin

PY - 2016/2/23

Y1 - 2016/2/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964843129&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964843129&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2014.7417246

DO - 10.1109/GLOCOM.2014.7417246

M3 - Conference contribution

AN - SCOPUS:84964843129

BT - 2015 IEEE Global Communications Conference, GLOBECOM 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -