You are here: Home :: Area NEM :: Mathematics

D. R. Stinson, R. Wei

Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols

Keywords: Private information retrieval,, boolean functions

In this paper, we investigate query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval (PIR) schemes. We begin by formulating a simplified model for PIR schemes which is equivalent to the usual model. We show that a query is equivalent to a boolean function of two variables, and we give a precise characterization of the boolean functions that can be used as "query pairs" to the two servers. We also consider several notions of "privacy" and we make a few remarks about the communication complexity of PIR schemes.

Mathematical Cryptology, Walter de Gruyter

Print ISSN: 1862-2976
Volume: 1, 01/2007
Pages: 33 - 46

Show full article (external site)

Show all available items of this journal

 

Area NEM