Results 281 to 290 of about 251,490 (326)

Taming the reference genome jungle: the refget sequence collection standard

open access: yes
Campbell DR   +11 more
europepmc   +1 more source

Private information retrieval

Communications of the ACM, 2010
Cryptographic protocols safeguard the privacy of user queries to public databases.
Matthew Fredrikson   +2 more
openaire   +2 more sources

Private information retrieval

Journal of the ACM, 1998
Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after.
Chor, Benny   +3 more
openaire   +1 more source

Noisy Private Information Retrieval

2018 52nd Asilomar Conference on Signals, Systems, and Computers, 2018
We consider the problem of noisy private information retrieval (NPIR) from $N$ non-communicating databases, each storing the same set of $M$ messages. In this model, the answer strings are not returned through noiseless bit pipes, but rather through noisy memoryless channels. We aim at characterizing the PIR capacity for this model as a function of the
Karim Banawan, Sennur Ulukus
openaire   +1 more source

A fast private information retrieval protocol

2008 IEEE International Symposium on Information Theory, 2008
A PIR scheme is a scheme that allows a user to get an element of a database without giving any information about what part of the database he is interested in. In this paper we present a lattice-based PIR scheme, based on problems close to coding theory problems known to be NP-complete [1], in which the computational cost is a few thousand bit ...
Aguilar Melchor, Carlos   +1 more
openaire   +2 more sources

Robust Information-Theoretic Private Information Retrieval

Journal of Cryptology, 2003
An information-theoretic private information retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database replicated amongst several servers, such that each server gains absolutely no information on the identity of the item being retrieved.
Amos Beimel, Yoav Stahl
openaire   +1 more source

Approximate private information retrieval

Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research, 2008
We present efficient protocols for the 1-out-of-n single-server Computationally-Private Information Retrieval (CPIR) problem for l-bit strings. In particular, our results achieve simultaneously polylogarithmic extra storage, communication, and Client and Server local computational complexities, improving the best current bounds.
openaire   +1 more source

Symmetrically Private Information Retrieval

2000
In this paper we present a single-round, single-server symmetrically private information retrieval scheme, in which privacy of user follows from intractability of the quadratic residuacity problem and the privacy of the database follows from the XOR assumption for quadratic residues introduced in this paper. The communication complexity of the proposed
Sanjeev Kumar Mishra, Palash Sarkar
openaire   +1 more source

Private information retrieval with partially known private side information

2018 52nd Annual Conference on Information Sciences and Systems (CISS), 2018
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user of cache-size M messages possesses side information in the form of full messages that are partially known to the databases.
Yi-Peng Wei   +2 more
openaire   +1 more source

Symmetric Private Information Retrieval at the Private Information Retrieval Rate

IEEE Journal on Selected Areas in Information Theory, 2022
Zhusheng Wang, Sennur Ulukus
openaire   +1 more source

Home - About - Disclaimer - Privacy