A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

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

2007
*
Journal of Mathematical Cryptology
*

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

doi:10.1515/jmc.2007.003
fatcat:mc2vexh5rjb27i23sdmkl47jja