TY - JOUR
T1 - PCloud
T2 - A distributed system for practical PIR
AU - Papadopoulos, Stavros
AU - Bakiras, Spiridon
AU - Papadias, Dimitris
PY - 2012
Y1 - 2012
N2 - Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve one bit from a database, without the server inferring any information about the queried bit. These protocols are too costly in practice because they invoke complex arithmetic operations for every bit of the database. In this paper, we present pCloud, a distributed system that constitutes the first attempt toward practical cPIR. Our approach assumes a disk-based architecture that retrieves one page with a single query. Using a striping technique, we distribute the database to a number of cooperative peers, and leverage their computational resources to process cPIR queries in parallel. We implemented pCloud on the PlanetLab network, and experimented extensively with several system parameters. Our results indicate that pCloud reduces considerably the query response time compared to the traditional client/server model, and has a very low communication overhead. Additionally, it scales well with an increasing number of peers, achieving a linear speedup.
AB - Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve one bit from a database, without the server inferring any information about the queried bit. These protocols are too costly in practice because they invoke complex arithmetic operations for every bit of the database. In this paper, we present pCloud, a distributed system that constitutes the first attempt toward practical cPIR. Our approach assumes a disk-based architecture that retrieves one page with a single query. Using a striping technique, we distribute the database to a number of cooperative peers, and leverage their computational resources to process cPIR queries in parallel. We implemented pCloud on the PlanetLab network, and experimented extensively with several system parameters. Our results indicate that pCloud reduces considerably the query response time compared to the traditional client/server model, and has a very low communication overhead. Additionally, it scales well with an increasing number of peers, achieving a linear speedup.
KW - Privacy
KW - databases
KW - distributed systems
KW - implementation
KW - private information retrieval
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000297068400010
UR - https://openalex.org/W2135043765
UR - https://www.scopus.com/pages/publications/81455142737
U2 - 10.1109/TDSC.2010.60
DO - 10.1109/TDSC.2010.60
M3 - Journal Article
SN - 1545-5971
VL - 9
SP - 115
EP - 127
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 1
M1 - 5611549
ER -