Sciweavers

219 search results - page 1 / 44
» Nearly Private Information Retrieval
Sort
View
81
Voted
MFCS
2007
Springer
15 years 4 months ago
Nearly Private Information Retrieval
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the clien...
Amit Chakrabarti, Anna Shubina
86
Voted
CC
2006
Springer
125views System Software» more  CC 2006»
14 years 10 months ago
A tight lower bound for restricted pir protocols
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...
Richard Beigel, Lance Fortnow, William I. Gasarch
84
Voted
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
15 years 3 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
78
Voted
JOC
2007
93views more  JOC 2007»
14 years 10 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 2 months ago
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
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...
Jens Groth, Aggelos Kiayias, Helger Lipmaa