We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Private retrieval of public data is useful when a client wants to query a public data service without revealing the specific query data to the server. Computational Private Informa...
We explore how Private Information Retrieval (PIR) can help users keep their sensitive information from being leaked in an SQL query. We show how to retrieve data from a relational...
For content level access, very often database needs the query as a sample image. However, the image may contain private information and hence the user does not wish to reveal the ...