We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
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...
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
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...
Private Information Retrieval (PIR) protocols allow users to learn data items stored at a server which is not fully trusted, without disclosing to the server the particular data e...
Ning Shang, Gabriel Ghinita, Yongbin Zhou, Elisa B...
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
In e-commerce, the protection of user privacy from a server was not considered feasible until the private information retrieval (PIR) problem was stated recently. A PIR protocol a...
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Traditionally, techniques for computing on encrypted data have been proposed with privacy preserving applications in mind. Several current cryptosystems support a homomorphic oper...